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 19:56highload-churnerhighload-churnerScore: 11,269Success
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 19:5710,541358,841,942300,098,00047,785,00020,480
2Oct 9, 2026 19:5710,719364,848,659305,643,00048,088,00020,480
3Oct 9, 2026 19:5710,802369,416,401307,404,00049,089,00020,480
4Oct 9, 2026 19:5711,225380,800,255319,892,00050,544,00020,480
5Oct 9, 2026 19:5711,269382,379,379320,684,00051,199,00020,480
6Oct 9, 2026 19:5711,294383,148,520322,329,00050,383,00020,480
7Oct 9, 2026 19:5711,300383,440,785323,503,00049,406,00020,480
8Oct 9, 2026 19:5711,301383,356,941323,027,00049,936,00020,480
9Oct 9, 2026 19:5711,387387,002,830326,630,00049,149,00020,480