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:34Victor MerckléVictor MerckléError
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:34085,791,330229,679,0003,183,0002,658,304expected "1020419 ", got "1020418 "
2Jun 26, 2026 02:342,85885,761,747229,800,0003,023,0002,658,304
3Jun 26, 2026 02:342,85985,783,090227,827,0003,132,0002,658,304
4Jun 26, 2026 02:342,86686,008,996229,390,0003,131,0002,658,304
5Jun 26, 2026 02:342,86786,023,754232,373,0001,031,0002,658,304
6Jun 26, 2026 02:342,87886,350,837231,215,0003,058,0002,658,304
7Jun 26, 2026 02:342,88286,482,021229,912,0003,164,0002,658,304
8Jun 26, 2026 02:342,88386,497,472230,921,0003,105,0002,658,304
9Jun 26, 2026 02:342,94288,276,695233,664,0002,073,0002,658,304