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 listJun 17, 2026 23:29Victor MerckléVictor MerckléScore: 3,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 23:303,604108,140,769289,463,0001,014,0002,654,208
2Jun 17, 2026 23:303,615108,462,568290,855,0001,026,0002,650,112
3Jun 17, 2026 23:303,634109,038,969291,972,0001,032,0002,654,208
4Jun 17, 2026 23:303,638109,152,909289,154,0003,169,0002,654,208
5Jun 17, 2026 23:303,653109,601,365290,930,0003,044,0002,654,208
6Jun 17, 2026 23:303,675110,253,108293,370,0003,042,0002,654,208
7Jun 17, 2026 23:303,681110,437,052292,962,0001,032,0002,654,208
8Jun 17, 2026 23:303,703111,102,601294,863,0003,075,0002,650,112
9Jun 17, 2026 23:303,731111,942,720296,750,0001,020,0002,650,112