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 listSep 15, 2026 01:58Josu San MartinJosu San MartinScore: 4,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 01:594,676140,291,121195,028,0004,129,0002,142,208
2Sep 15, 2026 01:594,688140,659,832195,189,0004,159,0002,142,208
3Sep 15, 2026 01:594,688140,646,528196,704,0004,266,0002,142,208
4Sep 15, 2026 01:594,691140,732,574195,279,0004,279,0002,142,208
5Sep 15, 2026 01:594,692140,783,914195,849,0004,168,0002,142,208
6Sep 15, 2026 01:594,697140,923,477195,450,0004,136,0002,142,208
7Sep 15, 2026 01:594,713141,413,331197,578,0003,077,0002,142,208
8Sep 15, 2026 01:594,725141,760,143197,196,0003,131,0002,142,208
9Sep 15, 2026 01:594,747142,412,089195,875,0004,138,0002,142,208