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 18:28Victor MerckléVictor MerckléScore: 2,132Success
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 18:302,09262,762,837156,477,0001,229,0002,170,880stderr
2Aug 16, 2026 18:302,11063,318,721156,961,0001,210,0002,170,880stderr
3Aug 16, 2026 18:302,11363,417,599157,263,0001,237,0002,170,880stderr
4Aug 16, 2026 18:302,12063,601,226156,658,0001,281,0002,170,880stderr
5Aug 16, 2026 18:302,13263,975,196157,046,0001,228,0002,170,880stderr
6Aug 16, 2026 18:302,13564,072,686157,856,0001,243,0002,170,880stderr
7Aug 16, 2026 18:302,15164,538,214158,037,0001,232,0002,170,880stderr
8Aug 16, 2026 18:302,15464,627,271157,143,0001,212,0002,170,880stderr
9Aug 16, 2026 18:302,15764,729,650156,005,0001,234,0002,170,880stderr