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 03:45highload-churnerhighload-churnerScore: 5,200Success
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 03:465,168179,527,209169,241,0001,313,0002,117,632
2Oct 13, 2026 03:465,194180,335,533170,088,0001,324,0002,117,632
3Oct 13, 2026 03:465,196180,459,727170,171,0001,310,0002,117,632
4Oct 13, 2026 03:465,199180,587,320170,268,0001,311,0002,117,632
5Oct 13, 2026 03:465,200180,574,371170,569,0001,042,0002,117,632
6Oct 13, 2026 03:465,206180,797,876170,507,0001,317,0002,117,632
7Oct 13, 2026 03:465,211180,773,049170,704,0001,270,0002,117,632
8Oct 13, 2026 03:465,213188,109,745170,775,0001,271,0002,117,632
9Oct 13, 2026 03:465,321184,593,280174,291,0001,324,0002,117,632