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 10, 2026 00:04highload-churnerhighload-churnerScore: 11,157Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:3911,083376,354,077362,490,0003,269,00020,480
2Oct 10, 2026 01:3911,087376,406,160362,505,0003,387,00020,480
3Oct 10, 2026 01:3911,123377,523,702363,787,0003,302,00020,480
4Oct 10, 2026 01:3911,126377,605,619363,893,0003,291,00020,480
5Oct 10, 2026 01:3911,157378,681,418364,861,0003,322,00020,480
6Oct 10, 2026 01:3911,161378,781,885365,022,0003,304,00020,480
7Oct 10, 2026 01:3911,169379,046,173365,257,0003,321,00020,480
8Oct 10, 2026 01:3911,176379,248,995365,478,0003,337,00020,480
9Oct 10, 2026 01:3911,348385,102,203370,711,0003,778,00020,480