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:27Victor MerckléVictor MerckléScore: 2,863Success
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:282,83785,116,021227,659,0003,053,0002,658,304
2Jun 26, 2026 02:282,85385,613,776229,072,0003,110,0002,658,304
3Jun 26, 2026 02:282,85985,774,037229,647,0003,099,0002,658,304
4Jun 26, 2026 02:282,86285,868,694229,830,0003,153,0002,658,304
5Jun 26, 2026 02:282,86385,900,902229,428,0003,079,0002,658,304
6Jun 26, 2026 02:282,87386,201,141229,828,0003,103,0002,658,304
7Jun 26, 2026 02:282,88786,616,675230,322,0003,048,0002,658,304
8Jun 26, 2026 02:282,92287,668,850233,908,0002,066,0002,654,208
9Jun 26, 2026 02:282,92787,825,144233,510,0001,015,0002,658,304