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 listOct 17, 2026 03:29highload-churnerhighload-churnerScore: 6,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 03:316,307189,226,189507,406,00015,516,000503,808
2Oct 17, 2026 03:316,308189,257,853507,404,00016,117,000499,712
3Oct 17, 2026 03:316,323189,719,170507,800,00016,067,000499,712
4Oct 17, 2026 03:316,372191,188,286506,522,00014,229,000499,712
5Oct 17, 2026 03:316,372191,174,143505,998,00014,952,000503,808
6Oct 17, 2026 03:316,373191,207,832506,273,00014,758,000499,712
7Oct 17, 2026 03:316,402192,079,071504,207,00014,891,000499,712
8Oct 17, 2026 03:316,406192,205,426505,061,00014,512,000499,712
9Oct 17, 2026 03:316,675200,267,997515,304,00014,167,000499,712