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 17, 2026 08:07M-RochatM-RochatScore: 20,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:0920,771623,155,068609,409,0003,261,0002,113,536
2May 17, 2026 08:0920,872626,176,352613,974,0003,243,0002,113,536
3May 17, 2026 08:0920,881626,440,656611,466,0003,197,0002,113,536
4May 17, 2026 08:0920,901627,041,848613,808,0003,333,0002,113,536
5May 17, 2026 08:0920,902627,086,152614,898,0003,249,0002,113,536
6May 17, 2026 08:0920,946628,382,446615,817,0003,300,0002,113,536
7May 17, 2026 08:0920,970629,129,565616,410,0003,294,0002,113,536
8May 17, 2026 08:0920,972629,168,232616,162,0003,337,0002,113,536
9May 17, 2026 08:0921,032630,969,403618,299,0003,307,0002,113,536