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 00:06Victor MerckléVictor MerckléScore: 3,162Success
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 00:073,03491,042,560244,577,0001,008,0002,658,304
2Jun 26, 2026 00:073,03791,117,900241,652,0003,084,0002,658,304
3Jun 26, 2026 00:073,04191,254,092242,424,0003,135,0002,662,400
4Jun 26, 2026 00:073,13293,966,710251,335,0003,108,0002,662,400
5Jun 26, 2026 00:073,16294,883,483253,269,0003,069,0002,662,400
6Jun 26, 2026 00:073,18095,412,252254,932,0003,149,0002,662,400
7Jun 26, 2026 00:073,18295,483,312251,994,0003,118,0002,654,208
8Jun 26, 2026 00:073,25797,734,263258,197,0002,106,0002,662,400
9Jun 26, 2026 00:073,28398,510,186259,245,0002,152,0002,654,208