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 11:41Victor MerckléVictor MerckléScore: 1,795Success
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 11:421,74852,466,773124,719,0002,024,0002,170,880stderr
2Sep 1, 2026 11:421,76853,061,298125,463,0002,023,0002,170,880stderr
3Sep 1, 2026 11:421,77153,158,928125,017,0002,038,0002,170,880stderr
4Sep 1, 2026 11:421,79553,854,576126,652,0001,040,0002,170,880stderr
5Sep 1, 2026 11:421,79553,871,129125,517,0001,031,0002,170,880stderr
6Sep 1, 2026 11:421,79553,870,769125,148,0001,033,0002,170,880stderr
7Sep 1, 2026 11:421,79753,933,081125,562,0001,033,0002,170,880stderr
8Sep 1, 2026 11:421,80754,215,039126,037,0001,049,0002,170,880stderr
9Sep 1, 2026 11:421,80854,246,004126,174,0001,038,0002,170,880stderr