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 listJun 7, 2026 15:38anboto1anboto1Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 15:3802,379,403,0512,344,676,00025,147,0002,113,536expected "1022894 ", got "1022936 "
2Jun 7, 2026 15:3802,379,621,6622,345,048,00025,117,0002,113,536expected "1023421 ", got "1023457 "
3Jun 7, 2026 15:3802,480,730,2682,447,172,00024,383,0002,113,536expected "1020054 ", got "1020083 "