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 06:00highload-churnerhighload-churnerScore: 2,822Success
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 06:012,801101,469,71991,192,0001,255,00020,480
2Oct 13, 2026 06:012,802101,347,25291,158,0001,309,00020,480
3Oct 13, 2026 06:012,813101,872,89991,404,0001,433,00020,480
4Oct 13, 2026 06:012,814106,586,06691,564,0001,306,00020,480
5Oct 13, 2026 06:012,822102,031,11691,879,0001,256,00020,480
6Oct 13, 2026 06:012,829102,269,53292,085,0001,293,00020,480
7Oct 13, 2026 06:012,851103,131,64392,775,0001,317,00020,480
8Oct 13, 2026 06:012,852103,176,40492,800,0001,333,00020,480
9Oct 13, 2026 06:012,863103,513,63893,215,0001,275,00020,480