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 27, 2026 00:18Victor MerckléVictor MerckléScore: 4,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 00:194,846167,789,215123,064,00036,866,0002,113,536
2Jun 27, 2026 00:194,856167,777,657123,611,00036,648,0002,113,536
3Jun 27, 2026 00:194,857169,581,825123,426,00036,855,0002,113,536
4Jun 27, 2026 00:194,857167,841,374123,554,00036,744,0002,113,536
5Jun 27, 2026 00:194,860167,929,225123,639,00036,764,0002,113,536
6Jun 27, 2026 00:194,861167,918,702123,628,00036,817,0002,113,536
7Jun 27, 2026 00:194,879169,155,061124,308,00036,699,0002,113,536
8Jun 27, 2026 00:194,879170,005,419123,436,00037,578,0002,113,536
9Jun 27, 2026 00:194,883168,684,726123,570,00037,576,0002,113,536