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 16, 2026 11:22highload-churnerhighload-churnerScore: 8,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 11:237,949271,430,009256,257,0006,092,00020,480
2Oct 16, 2026 11:237,949271,477,864256,309,0006,038,00020,480
3Oct 16, 2026 11:237,950271,483,967256,291,0006,077,00020,480
4Oct 16, 2026 11:237,992272,724,439257,647,0006,116,00020,480
5Oct 16, 2026 11:238,002273,244,754258,039,0006,053,00020,480
6Oct 16, 2026 11:238,057275,100,626259,790,0006,111,00020,480
7Oct 16, 2026 11:238,063275,080,696259,943,0006,139,00020,480
8Oct 16, 2026 11:238,251281,353,788266,154,0006,147,00020,480
9Oct 16, 2026 11:238,290282,720,130267,555,0006,040,00020,480