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:47highload-churnerhighload-churnerScore: 11,553Success
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 22:4111,052375,730,494315,971,00048,760,00020,480
2Oct 9, 2026 22:4111,318384,154,167323,859,00049,641,00020,480
3Oct 9, 2026 22:4111,511390,351,154329,584,00050,290,00020,480
4Oct 9, 2026 22:4111,536391,213,260330,859,00049,830,00020,480
5Oct 9, 2026 22:4111,553391,744,628330,786,00050,487,00020,480
6Oct 9, 2026 22:4111,591393,003,596332,096,00050,437,00020,480
7Oct 9, 2026 22:4111,616393,756,390332,475,00050,864,00020,480
8Oct 9, 2026 22:4111,656395,041,761334,258,00050,408,00020,480
9Oct 9, 2026 22:4111,796399,786,676339,663,00049,623,00020,480