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 listJun 11, 2026 15:47Victor MerckléVictor MerckléScore: 3,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 15:483,07192,142,941239,681,0003,031,0002,654,208
2Jun 11, 2026 15:483,08292,480,957241,759,0002,041,0002,654,208
3Jun 11, 2026 15:483,09492,843,754243,874,0001,034,0002,654,208
4Jun 11, 2026 15:483,09692,896,340241,485,0003,074,0002,654,208
5Jun 11, 2026 15:483,11693,500,357243,282,0003,080,0002,654,208
6Jun 11, 2026 15:483,12693,802,078244,596,0003,113,0002,650,112
7Jun 11, 2026 15:483,13794,118,435245,339,0003,058,0002,654,208
8Jun 11, 2026 15:483,16895,042,054243,419,0003,022,0002,654,208
9Jun 11, 2026 15:483,18295,488,351246,167,0003,092,0002,654,208