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:18highload-churnerhighload-churnerScore: 5,580Success
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:195,523191,323,558180,959,0001,312,0002,117,632
2Oct 13, 2026 03:195,540191,898,395181,783,0001,057,0002,117,632
3Oct 13, 2026 03:195,555192,372,581182,025,0001,317,0002,117,632
4Oct 13, 2026 03:195,560192,526,878182,181,0001,323,0002,117,632
5Oct 13, 2026 03:195,580193,111,487182,835,0001,310,0002,117,632
6Oct 13, 2026 03:195,583193,260,893183,208,0001,051,0002,117,632
7Oct 13, 2026 03:195,590193,307,086182,973,0001,499,0002,117,632
8Oct 13, 2026 03:195,598193,810,037183,428,0001,323,0002,117,632
9Oct 13, 2026 03:195,602194,466,371183,490,0001,391,0002,117,632