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 8, 2026 05:18highload-churnerhighload-churnerScore: 1,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 05:191,46944,079,884103,409,0000614,400stderr
2Nov 8, 2026 05:191,47644,289,397103,463,0000614,400stderr
3Nov 8, 2026 05:191,47644,289,860101,681,0002,017,000614,400stderr
4Nov 8, 2026 05:191,48344,499,909102,412,0002,054,000614,400stderr
5Nov 8, 2026 05:191,51145,332,960103,780,0002,031,000614,400stderr
6Nov 8, 2026 05:191,51345,402,160103,951,0002,042,000614,400stderr
7Nov 8, 2026 05:191,52045,609,932104,755,0002,064,000614,400stderr
8Nov 8, 2026 05:191,52145,641,774104,510,0002,067,000614,400stderr
9Nov 8, 2026 05:191,54146,252,511103,282,0002,024,000614,400stderr