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 16, 2026 03:07Victor MerckléVictor MerckléScore: 3,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 03:083,05391,609,708241,485,0001,007,0002,654,208
2Jun 16, 2026 03:083,08592,575,658242,842,0001,012,0002,654,208
3Jun 16, 2026 03:083,09492,825,291241,772,0003,094,0002,654,208
4Jun 16, 2026 03:083,10593,162,045246,293,00002,654,208
5Jun 16, 2026 03:083,10693,182,059245,097,0001,030,0002,650,112
6Jun 16, 2026 03:083,10993,279,291243,086,0003,119,0002,650,112
7Jun 16, 2026 03:083,10993,273,371243,057,0003,107,0002,650,112
8Jun 16, 2026 03:083,12293,667,236248,025,0001,016,0002,654,208
9Jun 16, 2026 03:083,13193,941,534241,197,0003,051,0002,650,112