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 13, 2026 04:35highload-churnerhighload-churnerScore: 3,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 04:363,844135,837,427125,627,0001,254,00020,480
2Oct 13, 2026 04:363,845137,345,245125,583,0001,312,00020,480
3Oct 13, 2026 04:363,846135,904,283125,627,0001,306,00020,480
4Oct 13, 2026 04:363,851135,990,351126,057,0001,051,00020,480
5Oct 13, 2026 04:363,851136,189,496125,865,0001,244,00020,480
6Oct 13, 2026 04:363,853136,068,635125,882,0001,271,00020,480
7Oct 13, 2026 04:363,860136,324,024126,104,0001,287,00020,480
8Oct 13, 2026 04:363,863136,478,469126,225,0001,257,00020,480
9Oct 13, 2026 04:363,868136,817,307126,323,0001,322,00020,480