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 24, 2026 05:46Victor MerckléVictor MerckléScore: 4,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 05:474,866168,282,701123,829,00036,769,0002,113,536
2Jun 24, 2026 05:474,871168,270,812123,882,00036,880,0002,113,536
3Jun 24, 2026 05:474,872168,403,656123,060,00037,722,0002,113,536
4Jun 24, 2026 05:474,882168,675,308123,425,00037,711,0002,113,536
5Jun 24, 2026 05:474,882168,597,960123,461,00037,665,0002,113,536
6Jun 24, 2026 05:474,898169,060,427123,908,00037,747,0002,113,536
7Jun 24, 2026 05:474,902169,430,179124,079,00037,687,0002,113,536
8Jun 24, 2026 05:474,906169,480,012123,958,00037,943,0002,113,536
9Jun 24, 2026 05:474,918169,877,644124,587,00037,715,0002,113,536