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 4, 2026 22:38olliecrowolliecrowScore: 13,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 22:3913,213396,415,525370,919,0009,353,0002,408,448
2May 4, 2026 22:3913,347400,436,560375,632,0009,321,0002,420,736
3May 4, 2026 22:3913,379401,378,706374,179,0009,517,0002,408,448
4May 4, 2026 22:3913,414402,443,621375,802,0009,770,0002,412,544
5May 4, 2026 22:3913,568407,065,440378,477,0009,686,0002,404,352
6May 4, 2026 22:3913,572407,187,609378,190,0009,935,0002,404,352
7May 4, 2026 22:3913,926417,805,765381,559,0009,604,0002,433,024
8May 4, 2026 22:3913,936418,106,737376,192,0009,510,0002,408,448
9May 4, 2026 22:3914,204426,130,842386,586,0009,850,0002,408,448