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 listApr 26, 2026 05:56limanjun99limanjun99Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 05:560445,020,443347,921,00081,981,0002,387,968expected "1025439 ", got "1025439back:486023780,front:1015066616,"
2Apr 26, 2026 05:560443,019,161338,911,00084,977,0002,396,160expected "1020345 ", got "1020345back:472407640,front:1006798452,"
3Apr 26, 2026 05:560443,781,288344,846,00080,963,0002,457,600expected "1023107 ", got "1023106back:475324104,front:1010038048,"