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 21, 2026 02:36Victor MerckléVictor MerckléScore: 6,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 02:376,431220,218,177174,777,00037,450,0002,113,536
2Jun 21, 2026 02:376,438219,990,951174,026,00038,453,0002,113,536
3Jun 21, 2026 02:376,443220,178,700174,418,00038,208,0002,113,536
4Jun 21, 2026 02:376,446220,389,268174,162,00038,572,0002,113,536
5Jun 21, 2026 02:376,447220,252,547174,396,00038,360,0002,113,536
6Jun 21, 2026 02:376,451220,890,382174,325,00038,580,0002,113,536
7Jun 21, 2026 02:376,463221,066,410175,751,00037,530,0002,113,536
8Jun 21, 2026 02:376,478221,348,535175,233,00038,572,0002,113,536
9Jun 21, 2026 02:376,478221,238,657175,415,00038,390,0002,113,536