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:40highload-churnerhighload-churnerScore: 5,325Success
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:415,264182,730,819172,458,0001,281,0002,117,632
2Oct 13, 2026 03:415,304184,060,618173,795,0001,245,0002,117,632
3Oct 13, 2026 03:415,304184,029,290173,704,0001,330,0002,117,632
4Oct 13, 2026 03:415,312184,175,240173,989,0001,319,0002,117,632
5Oct 13, 2026 03:415,325184,748,771174,412,0001,321,0002,117,632
6Oct 13, 2026 03:415,325184,817,951174,344,0001,386,0002,117,632
7Oct 13, 2026 03:415,331184,974,338174,618,0001,316,0002,117,632
8Oct 13, 2026 03:415,358185,885,160175,536,0001,299,0002,117,632
9Oct 13, 2026 03:415,398187,123,908176,843,0001,306,0002,117,632