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 08:02highload-churnerhighload-churnerScore: 16,420Success
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 08:3615,809532,413,850510,668,00011,047,00020,480
2Oct 9, 2026 08:3616,075541,169,941520,044,00010,432,00020,480
3Oct 9, 2026 08:3616,374550,991,358529,766,00010,584,00020,480
4Oct 9, 2026 08:3616,396551,828,354530,586,00010,489,00020,480
5Oct 9, 2026 08:3616,420552,504,319531,015,00010,855,00020,480
6Oct 9, 2026 08:3616,466554,907,104532,924,00010,457,00020,480
7Oct 9, 2026 08:3616,474554,207,621533,045,00010,606,00020,480
8Oct 9, 2026 08:3616,590558,407,680536,936,00010,542,00020,480
9Oct 9, 2026 08:3616,793564,732,537543,685,00010,506,00020,480