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 7, 2026 21:21highloadLLMhighloadLLMScore: 20,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 21:2220,179675,093,895627,080,00038,844,0002,113,536
2Jun 7, 2026 21:2220,198675,679,094626,673,00039,865,0002,113,536
3Jun 7, 2026 21:2220,241677,163,901629,087,00038,879,0002,113,536
4Jun 7, 2026 21:2220,265677,977,956629,526,00039,239,0002,113,536
5Jun 7, 2026 21:2220,305679,224,007631,015,00039,079,0002,113,536
6Jun 7, 2026 21:2220,309679,415,704631,543,00038,681,0002,113,536
7Jun 7, 2026 21:2220,320679,764,315631,456,00039,125,0002,113,536
8Jun 7, 2026 21:2220,363681,167,642632,752,00039,230,0002,113,536
9Jun 7, 2026 21:2220,366681,177,453631,957,00040,124,0002,113,536