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 listSep 1, 2026 07:45Victor MerckléVictor MerckléScore: 1,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 07:471,97359,199,077144,367,0002,032,0002,170,880stderr
2Sep 1, 2026 07:471,98559,558,258143,926,0002,030,0002,170,880stderr
3Sep 1, 2026 07:471,98759,610,905145,527,0001,024,0002,170,880stderr
4Sep 1, 2026 07:471,99259,774,409144,531,0002,052,0002,170,880stderr
5Sep 1, 2026 07:471,99359,810,680144,613,0002,052,0002,170,880stderr
6Sep 1, 2026 07:471,99759,937,348144,022,0001,024,0002,170,880stderr
7Sep 1, 2026 07:471,99859,961,544145,549,0001,036,0002,170,880stderr
8Sep 1, 2026 07:471,99959,999,191145,770,0001,031,0002,170,880stderr
9Sep 1, 2026 07:472,00560,161,134145,692,0001,027,0002,170,880stderr