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 listMay 11, 2026 20:04Victor MerckléVictor MerckléScore: 6,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:056,656227,018,949181,675,00037,979,0002,113,536
2May 11, 2026 20:056,665227,333,290181,034,00038,916,0002,113,536
3May 11, 2026 20:056,668227,431,906181,196,00038,863,0002,113,536
4May 11, 2026 20:056,673229,438,981182,232,00037,989,0002,113,536
5May 11, 2026 20:056,679227,959,217181,729,00038,693,0002,113,536
6May 11, 2026 20:056,679230,165,970181,444,00038,974,0002,113,536
7May 11, 2026 20:056,690228,146,634181,729,00039,046,0002,113,536
8May 11, 2026 20:056,695230,194,866182,432,00038,509,0002,113,536
9May 11, 2026 20:056,702230,168,284182,180,00038,996,0002,113,536