Unique strings Sergey Svistunov

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 22:23highload-churnerhighload-churnerScore: 9,519Success
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 23:399,468323,019,542270,632,00041,837,00020,480
2Oct 9, 2026 23:399,490323,731,358270,225,00042,955,00020,480
3Oct 9, 2026 23:399,490323,620,175270,027,00043,169,00020,480
4Oct 9, 2026 23:399,503324,189,798269,873,00043,732,00020,480
5Oct 9, 2026 23:399,519324,563,279271,174,00042,978,00020,480
6Oct 9, 2026 23:399,528324,850,017270,595,00043,829,00020,480
7Oct 9, 2026 23:399,531324,994,064271,681,00042,863,00020,480
8Oct 9, 2026 23:399,666329,508,206275,414,00043,585,00020,480
9Oct 9, 2026 23:399,726331,314,976278,110,00042,865,00020,480