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 23:52highload-churnerhighload-churnerScore: 12,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:3312,407419,865,671399,028,00010,420,00020,480
2Oct 10, 2026 01:3312,413420,458,488399,088,00010,551,00020,480
3Oct 10, 2026 01:3312,416420,264,295399,024,00010,736,00020,480
4Oct 10, 2026 01:3312,441421,076,637400,044,00010,526,00020,480
5Oct 10, 2026 01:3312,443421,072,735400,176,00010,474,00020,480
6Oct 10, 2026 01:3312,513423,571,112402,379,00010,564,00020,480
7Oct 10, 2026 01:3312,545424,493,151403,499,00010,514,00020,480
8Oct 10, 2026 01:3312,598426,199,313405,486,00010,270,00020,480
9Oct 10, 2026 01:3312,710430,077,107408,902,00010,541,00020,480