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 17:12Victor MerckléVictor MerckléScore: 2,001Success
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 17:131,95458,648,225145,350,0001,006,0002,170,880stderr
2Aug 23, 2026 17:131,97359,202,260145,170,0001,010,0002,170,880stderr
3Aug 23, 2026 17:131,98659,591,377146,049,0001,008,0002,170,880stderr
4Aug 23, 2026 17:131,99659,889,971149,474,0001,262,0002,170,880stderr
5Aug 23, 2026 17:132,00160,054,406148,180,0002,011,0002,170,880stderr
6Aug 23, 2026 17:132,00960,293,387147,442,0001,030,0002,170,880stderr
7Aug 23, 2026 17:132,01260,369,837146,873,0001,009,0002,170,880stderr
8Aug 23, 2026 17:132,06862,067,496155,332,0001,007,0002,170,880stderr
9Aug 23, 2026 17:132,09262,783,756155,369,0001,005,0002,170,880stderr