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 05:28olliecrowolliecrowScore: 12,699Success
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 05:2912,608378,248,197357,472,0009,671,0002,129,920
2May 17, 2026 05:2912,620378,627,709359,994,0009,378,0002,129,920
3May 17, 2026 05:2912,666380,004,704358,380,00011,509,0002,129,920
4May 17, 2026 05:2912,692380,776,973360,415,0009,166,0002,129,920
5May 17, 2026 05:2912,699380,998,573360,197,0009,636,0002,129,920
6May 17, 2026 05:2912,703381,109,964360,040,0009,720,0002,129,920
7May 17, 2026 05:2912,777383,318,838361,997,0009,448,0002,129,920
8May 17, 2026 05:2912,785383,567,171363,949,0009,698,0002,129,920
9May 17, 2026 05:2912,788383,669,491362,060,0009,564,0002,129,920