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 3, 2026 15:54Victor MerckléVictor MerckléScore: 2,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 15:552,84785,435,491227,243,0003,082,0002,658,304stderr
2Jul 3, 2026 15:552,89286,780,818233,362,0001,013,0002,662,400stderr
3Jul 3, 2026 15:552,89886,969,742232,024,0003,159,0002,658,304stderr
4Jul 3, 2026 15:552,90287,063,533231,876,0003,145,0002,662,400stderr
5Jul 3, 2026 15:552,90587,173,364232,478,0003,074,0002,662,400stderr
6Jul 3, 2026 15:552,92887,856,960233,661,0003,079,0002,658,304stderr
7Jul 3, 2026 15:552,97889,357,613234,339,0003,156,0002,662,400stderr
8Jul 3, 2026 15:552,99589,853,153235,183,0003,099,0002,662,400stderr
9Jul 3, 2026 15:553,00990,285,157237,305,0003,089,0002,662,400stderr