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 13:48Victor MerckléVictor MerckléScore: 2,110Success
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 13:522,07762,332,179155,208,0001,147,0002,170,880stderr
2Aug 17, 2026 13:522,09262,772,627155,721,0001,155,0002,170,880stderr
3Aug 17, 2026 13:522,10063,011,094156,489,0001,208,0002,170,880stderr
4Aug 17, 2026 13:522,10363,105,821156,397,0001,221,0002,170,880stderr
5Aug 17, 2026 13:522,11063,320,344156,132,0001,279,0002,170,880stderr
6Aug 17, 2026 13:522,12463,740,055155,918,0001,167,0002,170,880stderr
7Aug 17, 2026 13:522,12763,831,393155,253,0001,163,0002,170,880stderr
8Aug 17, 2026 13:522,13664,096,829156,695,0001,237,0002,170,880stderr
9Aug 17, 2026 13:522,14164,249,560156,102,0001,247,0002,170,880stderr