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 listJul 7, 2026 06:03Victor MerckléVictor MerckléScore: 3,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 06:063,588107,656,109294,197,0003,179,0002,662,400stderr
2Jul 7, 2026 06:063,597107,925,055294,210,0003,133,0002,662,400stderr
3Jul 7, 2026 06:063,598107,945,844294,322,0003,072,0002,658,304stderr
4Jul 7, 2026 06:063,604108,142,651295,047,0003,100,0002,658,304stderr
5Jul 7, 2026 06:063,611108,352,353294,993,0003,129,0002,420,736stderr
6Jul 7, 2026 06:063,650109,515,801295,059,0003,168,0002,662,400stderr
7Jul 7, 2026 06:063,676110,286,996298,563,0001,010,0002,662,400stderr
8Jul 7, 2026 06:063,677110,321,165295,945,0003,129,0002,662,400stderr
9Jul 7, 2026 06:063,735112,072,870303,952,0001,029,0002,662,400stderr