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 16, 2026 06:11highload-churnerhighload-churnerScore: 6,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 06:126,927207,839,857509,437,0009,985,000139,264
2Oct 16, 2026 06:126,927207,811,106510,275,00010,072,000143,360
3Oct 16, 2026 06:126,937208,133,018510,284,0009,994,000147,456
4Oct 16, 2026 06:126,944208,330,554511,571,0009,908,000143,360
5Oct 16, 2026 06:126,966209,000,350509,089,00010,188,000147,456
6Oct 16, 2026 06:126,984209,529,596509,278,0009,991,000151,552
7Oct 16, 2026 06:127,067212,037,635512,015,00010,101,000143,360
8Oct 16, 2026 06:127,150214,527,693515,617,00010,041,000155,648
9Oct 16, 2026 06:127,175215,276,854515,998,00010,078,000143,360