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 listMay 13, 2026 15:18Pavel SkripkinPavel SkripkinScore: 13,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 15:1912,768428,876,441419,365,0002,008,0002,117,632
2May 13, 2026 15:1912,770429,795,927418,412,0003,022,0002,117,632
3May 13, 2026 15:1912,853431,776,327422,158,0002,008,0002,117,632
4May 13, 2026 15:1913,045439,382,164427,505,0003,008,0002,117,632
5May 13, 2026 15:1913,250444,742,129435,253,0002,008,0002,117,632
6May 13, 2026 15:1913,622458,029,178446,515,0003,029,0002,117,632
7May 13, 2026 15:1913,857464,701,659454,197,0003,095,0002,117,632
8May 13, 2026 15:1914,710492,896,466482,387,0003,059,0002,117,632
9May 13, 2026 15:1914,835497,022,945486,540,0003,042,0002,117,632