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 26, 2026 03:44Victor MerckléVictor MerckléScore: 2,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 03:452,84385,315,221228,128,0003,081,0002,654,208
2Jun 26, 2026 03:452,84585,371,329228,347,0003,122,0002,658,304
3Jun 26, 2026 03:452,85185,548,487228,831,0003,139,0002,658,304
4Jun 26, 2026 03:452,85385,608,539229,280,0003,129,0002,658,304
5Jun 26, 2026 03:452,86085,826,565229,703,0003,117,0002,658,304
6Jun 26, 2026 03:452,87386,211,667230,491,0003,139,0002,654,208
7Jun 26, 2026 03:452,90887,250,166232,159,0003,138,0002,412,544
8Jun 26, 2026 03:452,91687,482,058231,792,0003,132,0002,658,304
9Jun 26, 2026 03:452,95688,688,251232,782,0003,031,0002,658,304