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 07:58highload-churnerhighload-churnerScore: 17,188Success
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:3016,888567,919,969546,512,00010,806,00020,480
2Oct 9, 2026 08:3016,917568,831,406547,202,00011,085,00020,480
3Oct 9, 2026 08:3017,144576,939,054554,479,00011,283,00020,480
4Oct 9, 2026 08:3017,187578,487,716556,284,00010,918,00020,480
5Oct 9, 2026 08:3017,188577,828,519555,668,00011,557,00020,480
6Oct 9, 2026 08:3017,224578,946,802557,161,00011,249,00020,480
7Oct 9, 2026 08:3017,379584,007,566562,586,00010,924,00020,480
8Oct 9, 2026 08:3017,396584,691,111562,921,00011,160,00020,480
9Oct 9, 2026 08:3017,644592,777,165571,070,00011,184,00020,480