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 19:55Victor MerckléVictor MerckléScore: 2,294Success
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 20:012,27168,139,388173,659,0001,221,0002,170,880stderr
2Aug 16, 2026 20:012,27468,240,433174,403,0001,220,0002,170,880stderr
3Aug 16, 2026 20:012,27968,374,915173,479,0001,217,0002,170,880stderr
4Aug 16, 2026 20:012,28168,447,894173,567,0001,222,0002,170,880stderr
5Aug 16, 2026 20:012,29468,823,380174,062,0001,237,0002,170,880stderr
6Aug 16, 2026 20:012,29468,849,378173,138,0001,248,0002,170,880stderr
7Aug 16, 2026 20:012,29668,899,862173,519,0001,219,0002,170,880stderr
8Aug 16, 2026 20:012,31169,357,714173,682,0001,235,0002,170,880stderr
9Aug 16, 2026 20:012,32469,735,196173,416,0001,232,0002,170,880stderr