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, 2026 00:43Victor MerckléVictor MerckléScore: 4,974Success
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, 2026 00:454,957171,701,787126,695,00036,899,0002,113,536
2Jun 23, 2026 00:454,966171,425,853127,017,00036,875,0002,113,536
3Jun 23, 2026 00:454,968171,456,227127,134,00036,819,0002,113,536
4Jun 23, 2026 00:454,968171,811,005127,273,00036,675,0002,113,536
5Jun 23, 2026 00:454,974171,980,876126,428,00037,720,0002,113,536
6Jun 23, 2026 00:454,976171,692,697127,325,00036,890,0002,113,536
7Jun 23, 2026 00:454,980172,136,768126,556,00037,793,0002,113,536
8Jun 23, 2026 00:454,989172,606,061126,829,00037,832,0002,113,536
9Jun 23, 2026 00:455,000172,469,229127,214,00037,794,0002,113,536