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:53Victor MerckléVictor MerckléScore: 2,015Success
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:541,98859,658,039147,794,0001,008,0002,170,880stderr
2Aug 23, 2026 14:541,99759,919,485147,218,0001,007,0002,170,880stderr
3Aug 23, 2026 14:542,00560,154,248149,036,0002,034,0002,170,880stderr
4Aug 23, 2026 14:542,00560,170,023148,321,0001,011,0002,170,880stderr
5Aug 23, 2026 14:542,01560,455,082151,006,0001,253,0002,170,880stderr
6Aug 23, 2026 14:542,01760,525,209148,702,0001,008,0002,170,880stderr
7Aug 23, 2026 14:542,01760,524,852148,088,0001,008,0002,170,880stderr
8Aug 23, 2026 14:542,03160,937,938152,195,0001,201,0002,170,880stderr
9Aug 23, 2026 14:542,05961,777,133154,894,0001,265,0002,170,880stderr