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 listAug 18, 2026 05:02Josu San MartinJosu San MartinScore: 4,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 05:034,658139,742,358193,985,0004,137,0002,142,208
2Aug 18, 2026 05:034,658139,751,290194,484,0004,136,0002,142,208
3Aug 18, 2026 05:034,666140,005,398196,681,0002,119,0002,142,208
4Aug 18, 2026 05:034,681140,433,909197,968,0002,084,0002,142,208
5Aug 18, 2026 05:034,689140,670,481196,869,0002,107,0002,142,208
6Aug 18, 2026 05:034,691140,742,956197,266,0002,105,0002,142,208
7Aug 18, 2026 05:034,695140,865,992197,547,0002,100,0002,142,208
8Aug 18, 2026 05:034,712141,367,315200,001,0003,127,0002,142,208
9Aug 18, 2026 05:034,737142,131,420197,405,0003,108,0002,142,208