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 13:54highload-churnerhighload-churnerScore: 13,891Success
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 14:0013,728463,585,204442,316,00010,720,00020,480
2Oct 9, 2026 14:0013,742464,071,138442,761,00010,726,00020,480
3Oct 9, 2026 14:0013,860467,830,820446,552,00010,857,00020,480
4Oct 9, 2026 14:0013,871468,147,837447,020,00010,733,00020,480
5Oct 9, 2026 14:0013,891468,890,484447,493,00010,923,00020,480
6Oct 9, 2026 14:0013,892468,983,908447,619,00010,849,00020,480
7Oct 9, 2026 14:0013,905469,271,261448,152,00010,743,00020,480
8Oct 9, 2026 14:0013,909469,579,426448,060,00010,946,00020,480
9Oct 9, 2026 14:0014,033473,666,334452,352,00010,757,00020,480