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 18, 2026 17:08Victor MerckléVictor MerckléScore: 3,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 17:093,05891,769,379238,914,0003,134,0002,658,304
2Jun 18, 2026 17:093,06491,940,106240,853,0002,161,0002,658,304
3Jun 18, 2026 17:093,09992,973,368241,666,0003,133,0002,658,304
4Jun 18, 2026 17:093,10293,080,229242,447,0003,125,0002,658,304
5Jun 18, 2026 17:093,10393,112,233246,101,00002,654,208
6Jun 18, 2026 17:093,11893,552,385243,752,0003,165,0002,658,304
7Jun 18, 2026 17:093,13093,900,560244,260,0003,073,0002,658,304
8Jun 18, 2026 17:093,17395,217,456245,995,0002,075,0002,658,304
9Jun 18, 2026 17:093,22296,688,549247,550,0002,099,0002,658,304