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:18Victor MerckléVictor MerckléScore: 3,100Success
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:193,07792,336,879240,261,0003,020,0002,641,920
2Jun 18, 2026 17:193,08892,648,158241,285,0003,148,0002,641,920
3Jun 18, 2026 17:193,09192,740,362241,221,0003,067,0002,641,920
4Jun 18, 2026 17:193,09192,738,757242,729,0002,016,0002,641,920
5Jun 18, 2026 17:193,10093,028,963245,509,0001,021,0002,641,920
6Jun 18, 2026 17:193,10893,247,439242,771,0003,088,0002,641,920
7Jun 18, 2026 17:193,11193,351,841242,833,0003,095,0002,641,920
8Jun 18, 2026 17:193,11693,494,272244,601,0003,055,0002,641,920
9Jun 18, 2026 17:193,17395,190,158244,925,0003,112,0002,641,920