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 17, 2026 00:45Victor MerckléVictor MerckléScore: 2,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 00:552,87186,141,419227,445,0001,006,0002,170,880stderr
2Aug 17, 2026 00:552,87386,195,425227,416,0001,217,0002,170,880stderr
3Aug 17, 2026 00:552,89086,720,178228,120,0001,213,0002,170,880stderr
4Aug 17, 2026 00:552,89386,809,929226,607,0001,240,0002,170,880stderr
5Aug 17, 2026 00:552,89786,920,041227,375,0001,216,0002,170,880stderr
6Aug 17, 2026 00:552,90687,200,421227,415,0001,251,0002,170,880stderr
7Aug 17, 2026 00:552,91987,583,624226,523,0001,234,0002,170,880stderr
8Aug 17, 2026 00:552,91987,582,224225,314,0001,257,0002,170,880stderr
9Aug 17, 2026 00:552,93187,952,104227,658,0001,233,0002,170,880stderr