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 listApr 28, 2026 17:09Victor MerckléVictor MerckléScore: 6,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 17:105,941178,257,705446,993,00014,999,0002,588,672
2Apr 28, 2026 17:105,973179,217,100452,383,00014,946,0002,908,160
3Apr 28, 2026 17:105,981179,446,989452,373,00013,980,0002,846,720
4Apr 28, 2026 17:105,996179,880,682461,647,00014,988,0002,883,584
5Apr 28, 2026 17:106,050181,506,182461,541,00011,988,0002,842,624
6Apr 28, 2026 17:106,058181,759,660462,435,00013,982,0002,883,584
7Apr 28, 2026 17:106,119183,576,954468,937,00012,970,0002,875,392
8Apr 28, 2026 17:106,156184,696,690467,879,00013,996,0002,842,624
9Apr 28, 2026 17:106,172185,184,931465,489,00011,961,0002,580,480