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 21:20highload-churnerhighload-churnerScore: 27,837Success
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 21:3927,697925,542,918701,797,000212,205,0001,069,056
2Oct 9, 2026 21:3927,718925,375,627702,542,000212,163,000757,760
3Oct 9, 2026 21:3927,778927,479,111702,410,000214,287,000765,952
4Oct 9, 2026 21:3927,784928,096,475705,501,000211,379,000733,184
5Oct 9, 2026 21:3927,837930,259,060705,524,000213,125,000745,472
6Oct 9, 2026 21:3927,849930,157,160704,734,000214,310,000757,760
7Oct 9, 2026 21:3928,105938,672,347713,159,000214,333,0001,019,904
8Oct 9, 2026 21:3928,136939,611,052712,367,000216,143,000724,992
9Oct 9, 2026 21:3928,147939,778,940713,541,000215,338,000696,320