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 16:16Victor MerckléVictor MerckléScore: 2,487Success
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 16:192,45973,793,995190,360,0001,218,0002,170,880stderr
2Aug 16, 2026 16:192,46173,857,566189,751,0001,219,0002,170,880stderr
3Aug 16, 2026 16:192,46874,068,630190,011,0001,237,0002,170,880stderr
4Aug 16, 2026 16:192,48174,455,047189,848,0001,220,0002,170,880stderr
5Aug 16, 2026 16:192,48774,614,525190,384,0001,244,0002,170,880stderr
6Aug 16, 2026 16:192,50375,116,364191,588,0001,230,0002,170,880stderr
7Aug 16, 2026 16:192,50575,157,506190,343,0001,238,0002,170,880stderr
8Aug 16, 2026 16:192,51275,366,544190,345,0001,248,0002,170,880stderr
9Aug 16, 2026 16:192,52075,615,413191,504,0001,239,0002,170,880stderr