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 23:16Victor MerckléVictor MerckléScore: 2,071Success
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 23:192,02960,889,641151,747,0001,259,0002,170,880stderr
2Aug 17, 2026 23:192,05261,571,644153,054,0001,005,0002,170,880stderr
3Aug 17, 2026 23:192,05361,617,057154,787,0001,144,0002,170,880stderr
4Aug 17, 2026 23:192,05961,790,820154,922,0001,150,0002,170,880stderr
5Aug 17, 2026 23:192,07162,131,260155,383,0001,205,0002,170,880stderr
6Aug 17, 2026 23:192,07762,320,534154,303,0001,218,0002,170,880stderr
7Aug 17, 2026 23:192,09662,891,184158,290,0001,005,0002,170,880stderr
8Aug 17, 2026 23:192,11663,495,528158,412,0001,232,0002,170,880stderr
9Aug 17, 2026 23:192,13063,921,115159,551,0001,213,0002,170,880stderr