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 23, 2025 03:34Ian MckibbenIan MckibbenScore: 15,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 03:2815,304532,940,080420,020,00085,004,0002,367,488
2Jun 23, 2025 03:2815,397532,912,260424,081,00084,016,0002,310,144
3Jun 23, 2025 03:3415,405530,804,715423,478,00084,895,0002,498,560
4Jun 23, 2025 03:2815,417527,873,250432,809,00075,966,0002,310,144
5Jun 23, 2025 03:3415,422536,476,794429,925,00078,986,0002,318,336
6Jun 23, 2025 03:3415,473537,625,637443,650,00066,947,0002,461,696