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 listJun 9, 2026 21:20Victor MerckléVictor MerckléScore: 3,259Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 21:263,24197,250,383253,336,0002,155,0002,142,208
2Jun 9, 2026 21:263,24297,286,602256,166,0001,021,0002,142,208
3Jun 9, 2026 21:263,25197,530,619255,934,0001,042,0002,142,208
4Jun 9, 2026 21:263,25497,629,987252,721,0002,333,0002,146,304
5Jun 9, 2026 21:263,25997,797,770254,267,0002,221,0002,142,208
6Jun 9, 2026 21:263,26597,952,095253,292,0002,332,0002,146,304
7Jun 9, 2026 21:263,27098,109,848256,130,0002,221,0002,142,208
8Jun 9, 2026 21:263,28698,603,541255,725,0001,177,0002,146,304
9Jun 9, 2026 21:263,30599,175,610258,580,0001,026,0002,142,208