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:25Victor MerckléVictor MerckléScore: 3,101Success
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:263,07592,255,833243,087,0001,004,0002,650,112
2Jun 18, 2026 17:263,07792,337,215241,831,0003,070,0002,650,112
3Jun 18, 2026 17:263,08292,483,901242,724,0001,021,0002,650,112
4Jun 18, 2026 17:263,09592,872,199242,065,0003,150,0002,650,112
5Jun 18, 2026 17:263,10193,051,714246,817,00002,650,112
6Jun 18, 2026 17:263,11493,429,513243,038,0003,163,0002,650,112
7Jun 18, 2026 17:263,12293,689,546245,196,0003,079,0002,650,112
8Jun 18, 2026 17:263,12593,750,503242,840,0003,025,0002,650,112
9Jun 18, 2026 17:263,14894,441,007245,916,0003,096,0002,650,112