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 18, 2026 17:09M-RochatM-RochatError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 17:090575,215,484563,624,0002,007,0002,113,536expected "1022171 ", got "1022156 "
2May 18, 2026 17:090578,891,379564,612,0002,008,0002,113,536expected "1023368 ", got "1023356 "
3May 18, 2026 17:090581,488,711567,536,0002,004,0002,113,536expected "1025665 ", got "1025656 "