Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJul 7, 2026 09:12Victor MerckléVictor MerckléScore: 3,090Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 09:152,98089,410,597230,423,0003,673,0002,674,688
2Jul 7, 2026 09:153,04691,398,638234,012,0004,312,0002,674,688
3Jul 7, 2026 09:153,05091,500,789235,420,0003,147,0002,674,688
4Jul 7, 2026 09:153,05291,585,061235,467,0003,186,0002,670,592
5Jul 7, 2026 09:153,09092,718,650240,266,0003,417,0002,674,688
6Jul 7, 2026 09:153,10393,112,784239,648,0003,716,0002,674,688
7Jul 7, 2026 09:153,10393,109,465239,610,0003,416,0002,670,592
8Jul 7, 2026 09:153,10993,291,542238,734,0003,700,0002,740,224
9Jul 7, 2026 09:153,11393,408,576241,719,0003,165,0002,433,024