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 listNov 6, 2026 17:01Andrew EpsteinAndrew EpsteinScore: 1,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2026 17:041,45443,646,29198,540,0002,014,0002,174,976stderr
2Nov 6, 2026 17:041,46643,992,95898,089,0003,164,0002,174,976stderr
3Nov 6, 2026 17:041,46844,055,14098,936,0003,007,0002,174,976stderr
4Nov 6, 2026 17:041,47544,257,16599,510,0003,106,0002,174,976stderr
5Nov 6, 2026 17:041,47844,342,35799,231,0003,181,0002,174,976stderr
6Nov 6, 2026 17:041,48044,409,28899,983,0003,134,0002,174,976stderr
7Nov 6, 2026 17:041,48244,462,83899,878,0003,120,0002,174,976stderr
8Nov 6, 2026 17:041,48744,624,826100,644,0003,106,0002,174,976stderr
9Nov 6, 2026 17:041,50445,132,655101,771,0003,073,0002,174,976stderr