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 24, 2026 04:23Victor MerckléVictor MerckléScore: 3,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 04:243,24097,218,187253,133,0002,514,0002,654,208
2Jun 24, 2026 04:243,24297,284,153252,240,0002,506,0002,654,208
3Jun 24, 2026 04:243,27198,142,291254,581,0002,508,0002,654,208
4Jun 24, 2026 04:243,30299,077,618255,802,0002,529,0002,650,112
5Jun 24, 2026 04:243,32299,674,505258,161,0002,543,0002,650,112
6Jun 24, 2026 04:243,338100,152,354258,667,0002,506,0002,408,448
7Jun 24, 2026 04:243,350100,525,866262,144,0002,520,0002,654,208
8Jun 24, 2026 04:243,365100,966,144259,801,0002,515,0002,654,208
9Jun 24, 2026 04:243,377101,336,162258,226,0002,613,0002,654,208