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 26, 2026 03:00Victor MerckléVictor MerckléScore: 3,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 03:013,05291,562,706246,389,0003,399,0002,658,304
2Jun 26, 2026 03:013,07192,154,471248,010,0003,479,0002,658,304
3Jun 26, 2026 03:013,10293,064,703250,644,0003,534,0002,658,304
4Jun 26, 2026 03:013,11893,541,035250,497,0003,507,0002,658,304
5Jun 26, 2026 03:013,13193,956,867250,326,0003,312,0002,658,304
6Jun 26, 2026 03:013,15194,539,300255,363,0003,297,0002,658,304
7Jun 26, 2026 03:013,18395,508,126252,363,0003,561,0002,658,304
8Jun 26, 2026 03:013,19095,729,948254,592,0003,528,0002,658,304
9Jun 26, 2026 03:013,24697,389,600257,091,0003,586,0002,658,304