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 16:23Victor MerckléVictor MerckléScore: 1,998Success
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 16:251,97459,230,921145,597,0002,015,0002,170,880stderr
2Aug 23, 2026 16:251,98159,445,793146,579,0001,027,0002,170,880stderr
3Aug 23, 2026 16:251,98559,563,758145,956,0002,028,0002,170,880stderr
4Aug 23, 2026 16:251,98959,681,283146,314,0001,009,0002,170,880stderr
5Aug 23, 2026 16:251,99859,962,531143,321,0002,065,0002,170,880stderr
6Aug 23, 2026 16:252,01460,440,436149,174,0001,023,0002,170,880stderr
7Aug 23, 2026 16:252,07762,338,295147,248,0001,036,0002,174,976stderr
8Aug 23, 2026 16:252,09162,735,526156,292,0002,016,0002,170,880stderr
9Aug 23, 2026 16:252,09662,905,115152,864,0001,026,0002,170,880stderr