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 17, 2026 02:47e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 02:4802,883,943,5812,870,739,0002,315,0002,113,536expected "1022671 ", got "981133 "
2Oct 17, 2026 02:4802,812,082,7542,798,899,0002,306,0002,113,536expected "1026657 ", got "985122 "
3Oct 17, 2026 02:4802,826,066,1932,813,211,0002,001,0002,113,536expected "1019179 ", got "978745 "