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 9, 2026 21:23highload-churnerhighload-churnerScore: 32,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:4731,882956,477,909718,657,000225,548,00045,056
2Oct 9, 2026 21:4731,927957,836,553719,189,000226,703,00045,056
3Oct 9, 2026 21:4731,940958,217,625718,645,000221,834,00045,056
4Oct 9, 2026 21:4731,992959,768,937720,678,000226,963,00045,056
5Oct 9, 2026 21:4732,088962,660,992722,601,000227,775,00045,056
6Oct 9, 2026 21:4732,147964,425,251723,435,000228,975,00045,056
7Oct 9, 2026 21:4732,302969,072,995728,090,000226,633,00073,728
8Oct 9, 2026 21:4732,309969,279,026728,130,000229,056,00045,056
9Oct 9, 2026 21:4732,363970,911,501728,254,000230,645,00045,056