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 listJul 3, 2026 16:13Victor MerckléVictor MerckléScore: 2,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 16:182,85785,732,567228,174,0003,077,0002,662,400stderr
2Jul 3, 2026 16:182,85985,771,745228,277,0003,024,0002,662,400stderr
3Jul 3, 2026 16:182,87486,234,317231,687,0001,016,0002,662,400stderr
4Jul 3, 2026 16:182,90487,145,319232,221,0003,087,0002,658,304stderr
5Jul 3, 2026 16:182,91387,404,508231,823,0001,007,0002,662,400stderr
6Jul 3, 2026 16:182,92087,614,051229,346,0003,068,0002,662,400stderr
7Jul 3, 2026 16:182,93187,938,174232,355,0001,006,0002,662,400stderr
8Jul 3, 2026 16:182,94088,204,813231,924,0003,095,0002,658,304stderr
9Jul 3, 2026 16:182,94388,296,569232,881,0001,026,0002,662,400stderr