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 02:19M-RochatM-RochatScore: 20,930Success
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 02:2120,672620,179,839606,442,0003,010,0002,113,536
2May 17, 2026 02:2120,779623,385,749611,195,0003,240,0002,113,536
3May 17, 2026 02:2120,889626,671,221614,340,0003,361,0002,113,536
4May 17, 2026 02:2120,930627,920,466613,218,0004,009,0002,113,536
5May 17, 2026 02:2120,930627,922,437615,736,0003,297,0002,113,536
6May 17, 2026 02:2120,944628,326,242616,100,0003,309,0002,113,536
7May 17, 2026 02:2121,037631,126,373616,679,0003,336,0002,113,536
8May 17, 2026 02:2121,062631,872,482619,414,0003,381,0002,113,536
9May 17, 2026 02:2121,248637,465,396623,488,0003,335,0002,113,536