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:00highload-churnerhighload-churnerScore: 6,098Success
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:016,049208,641,453197,814,0001,824,0002,117,632
2Oct 13, 2026 03:016,074209,553,813198,563,0001,900,0002,117,632
3Oct 13, 2026 03:016,074209,492,812198,579,0001,885,0002,117,632
4Oct 13, 2026 03:016,082209,780,957198,863,0001,847,0002,117,632
5Oct 13, 2026 03:016,098210,217,958198,954,0002,285,0002,117,632
6Oct 13, 2026 03:016,103210,488,951199,566,0001,851,0002,117,632
7Oct 13, 2026 03:016,143212,591,235200,920,0001,820,0002,117,632
8Oct 13, 2026 03:016,189213,353,873202,379,0001,880,0002,117,632
9Oct 13, 2026 03:016,203214,005,189202,815,0001,902,0002,117,632