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 22:30Victor MerckléVictor MerckléScore: 2,779Success
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 22:432,69880,962,965212,670,0001,138,0002,170,880stderr
2Aug 17, 2026 22:432,73982,189,196216,339,0001,240,0002,170,880stderr
3Aug 17, 2026 22:432,73982,174,771215,180,0001,255,0002,170,880stderr
4Aug 17, 2026 22:432,75982,774,286216,830,0001,235,0002,170,880stderr
5Aug 17, 2026 22:432,77983,375,422217,938,0001,208,0002,170,880stderr
6Aug 17, 2026 22:433,933117,999,056299,446,0001,190,0002,170,880stderr
7Aug 17, 2026 22:434,901147,044,012337,680,0002,079,0002,170,880stderr
8Aug 17, 2026 22:434,936148,094,520332,763,0002,005,0002,170,880stderr
9Aug 17, 2026 22:435,383161,496,117392,493,0002,130,0002,170,880stderr