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 18, 2026 16:25M-RochatM-RochatScore: 22,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 16:2720,676620,303,215605,572,0004,013,0002,113,536
2May 18, 2026 16:2720,748622,446,441608,332,0004,069,0002,113,536
3May 18, 2026 16:2720,776623,295,053609,539,0003,007,0002,113,536
4May 18, 2026 16:2722,227666,823,585653,257,0004,120,0002,113,536
5May 18, 2026 16:2722,328669,840,222655,377,0004,168,0002,113,536
6May 18, 2026 16:2722,330669,912,827654,580,0004,278,0002,113,536
7May 18, 2026 16:2722,365670,962,119654,766,0004,197,0002,113,536
8May 18, 2026 16:2722,367671,025,496657,081,0004,192,0002,113,536
9May 18, 2026 16:2722,393671,808,763658,026,0004,129,0002,113,536