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 listAug 23, 2026 14:41Victor MerckléVictor MerckléScore: 2,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 14:432,67580,267,695211,044,0001,274,0002,170,880stderr
2Aug 23, 2026 14:432,68880,647,991209,913,0001,003,0002,170,880stderr
3Aug 23, 2026 14:432,69580,861,798210,043,0001,005,0002,170,880stderr
4Aug 23, 2026 14:432,69980,998,703212,647,0001,243,0002,170,880stderr
5Aug 23, 2026 14:432,70081,007,221211,236,0001,004,0002,170,880stderr
6Aug 23, 2026 14:432,72781,815,702215,050,0001,250,0002,170,880stderr
7Aug 23, 2026 14:432,76682,990,259218,388,0001,200,0002,170,880stderr
8Aug 23, 2026 14:432,78083,427,050219,189,0001,006,0002,170,880stderr
9Aug 23, 2026 14:432,79283,784,723218,415,0001,020,0002,170,880stderr