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 8, 2026 02:18Victor MerckléVictor MerckléScore: 8,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:198,876300,454,469252,246,00040,683,0002,113,536
2Jun 8, 2026 02:198,879302,366,389252,397,00040,631,0002,113,536
3Jun 8, 2026 02:198,885300,841,352252,675,00040,553,0002,113,536
4Jun 8, 2026 02:198,890300,910,914253,766,00039,630,0002,113,536
5Jun 8, 2026 02:198,891300,967,046252,874,00040,535,0002,113,536
6Jun 8, 2026 02:198,898301,350,985253,830,00039,830,0002,113,536
7Jun 8, 2026 02:198,914301,753,917253,400,00040,770,0002,113,536
8Jun 8, 2026 02:198,924302,118,676253,500,00041,006,0002,113,536
9Jun 8, 2026 02:198,966305,506,297255,073,00040,824,0002,113,536