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 12, 2026 04:15highload-churnerhighload-churnerScore: 9,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 04:169,169311,717,596259,552,00043,032,00024,576
2Oct 12, 2026 04:169,184311,970,792258,686,00044,406,00024,576
3Oct 12, 2026 04:169,186312,165,660260,135,00043,004,00024,576
4Oct 12, 2026 04:169,197312,389,424260,689,00042,820,00024,576
5Oct 12, 2026 04:169,208312,947,707261,982,00041,884,00024,576
6Oct 12, 2026 04:169,220313,229,381261,408,00042,863,00024,576
7Oct 12, 2026 04:169,239314,577,660261,988,00042,907,00024,576
8Oct 12, 2026 04:169,260314,546,074262,879,00042,727,00024,576
9Oct 12, 2026 04:169,261314,647,018262,864,00042,750,00024,576