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 26, 2026 02:18Victor MerckléVictor MerckléScore: 2,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 02:192,83084,928,491227,097,0003,097,0002,658,304
2Jun 26, 2026 02:192,83184,942,688227,131,0003,046,0002,658,304
3Jun 26, 2026 02:192,85285,570,789230,086,0002,051,0002,654,208
4Jun 26, 2026 02:192,86385,897,659228,765,0003,113,0002,654,208
5Jun 26, 2026 02:192,87386,207,062229,633,0003,182,0002,658,304
6Jun 26, 2026 02:192,87386,214,124229,824,0003,140,0002,654,208
7Jun 26, 2026 02:192,90087,011,190229,080,0003,106,0002,658,304
8Jun 26, 2026 02:192,92087,603,614230,868,0003,125,0002,412,544
9Jun 26, 2026 02:192,93788,131,689233,066,0003,064,0002,654,208