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 16, 2026 04:24Victor MerckléVictor MerckléScore: 3,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 04:253,567107,036,264289,626,0001,048,0002,170,880stderr
2Aug 16, 2026 04:253,587107,630,267289,930,0001,109,0002,170,880stderr
3Aug 16, 2026 04:253,602108,088,699293,383,0001,040,0002,170,880stderr
4Aug 16, 2026 04:253,605108,151,093293,659,0001,049,0002,170,880stderr
5Aug 16, 2026 04:253,605108,154,019293,086,0001,046,0002,170,880stderr
6Aug 16, 2026 04:253,605108,174,556293,001,0001,099,0002,170,880stderr
7Aug 16, 2026 04:253,611108,340,806292,264,0001,007,0002,170,880stderr
8Aug 16, 2026 04:253,644109,347,409293,680,0001,122,0002,170,880stderr
9Aug 16, 2026 04:253,645109,353,463296,223,0001,127,0002,170,880stderr