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 28, 2026 07:58Victor MerckléVictor MerckléScore: 3,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 07:593,647128,090,757119,262,0001,118,0002,113,536
2Jun 28, 2026 07:593,654128,919,303119,437,0001,172,0002,113,536
3Jun 28, 2026 07:593,657128,710,831119,513,0001,176,0002,113,536
4Jun 28, 2026 07:593,660128,824,672119,600,0001,191,0002,113,536
5Jun 28, 2026 07:593,662128,552,535119,677,0001,175,0002,113,536
6Jun 28, 2026 07:593,670129,368,989119,956,0001,169,0002,113,536
7Jun 28, 2026 07:593,680129,521,750120,282,0001,173,0002,113,536
8Jun 28, 2026 07:593,686129,855,917120,449,0001,191,0002,113,536
9Jun 28, 2026 07:593,695131,419,314120,777,0001,173,0002,113,536