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 6, 2026 14:28Victor MerckléVictor MerckléScore: 4,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 14:294,284128,545,864352,296,0004,154,0002,646,016
2Jun 6, 2026 14:294,425132,768,042361,690,0005,483,0002,646,016
3Jun 6, 2026 14:294,444133,328,501358,545,0005,522,0002,646,016
4Jun 6, 2026 14:294,453133,607,956362,201,0005,434,0002,641,920
5Jun 6, 2026 14:294,472134,176,336368,387,0005,484,0002,646,016
6Jun 6, 2026 14:294,506135,208,065366,924,0005,481,0002,641,920
7Jun 6, 2026 14:294,518135,541,403361,841,0005,512,0002,641,920
8Jun 6, 2026 14:294,544136,339,433372,585,0005,404,0002,641,920
9Jun 6, 2026 14:294,569137,085,740368,224,0005,529,0002,646,016