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 11, 2026 14:22Victor MerckléVictor MerckléScore: 3,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 14:233,10893,260,225244,854,0001,007,0002,142,208
2Jun 11, 2026 14:233,10993,273,099244,580,0001,006,0002,138,112
3Jun 11, 2026 14:233,11393,400,770245,000,0001,047,0002,138,112
4Jun 11, 2026 14:233,11593,468,969245,613,0001,010,0002,138,112
5Jun 11, 2026 14:233,14394,318,277244,026,0002,035,0002,138,112
6Jun 11, 2026 14:233,14994,481,120248,366,0001,005,0002,138,112
7Jun 11, 2026 14:233,18695,603,911248,042,0001,014,0002,138,112
8Jun 11, 2026 14:233,18995,670,730246,077,0003,054,0002,138,112
9Jun 11, 2026 14:233,22396,705,623250,782,0001,029,0002,138,112