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 6, 2026 18:58olliecrowolliecrowError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 18:580427,715,185364,816,00043,657,0002,314,240expected "1019157 ", got "1019021 "
2May 6, 2026 18:580419,742,198359,256,00043,690,0002,297,856expected "1017902 ", got "1017788 "
3May 6, 2026 18:580419,870,732357,619,00043,064,0002,314,240expected "1019110 ", got "1018995 "