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 listMay 16, 2026 08:36M-RochatM-RochatScore: 30,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:4330,748922,462,934906,122,0007,055,0002,113,536
2May 16, 2026 08:4330,760922,815,803905,893,0006,959,0002,113,536
3May 16, 2026 08:4330,771923,136,119906,993,0007,015,0002,113,536
4May 16, 2026 08:4330,785923,565,384905,548,0007,154,0002,113,536
5May 16, 2026 08:4330,794923,843,514907,248,0007,349,0002,113,536
6May 16, 2026 08:4330,820924,624,903907,007,0007,142,0002,113,536
7May 16, 2026 08:4331,011930,340,505913,774,0007,074,0002,113,536
8May 16, 2026 08:4331,085932,557,508916,523,0007,244,0002,113,536
9May 16, 2026 08:4331,122933,673,870914,465,0007,161,0002,113,536