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 00:11highloadLLMhighloadLLMScore: 17,910Success
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 00:1217,674592,309,647544,906,00038,356,0002,113,536
2Jun 8, 2026 00:1217,770595,665,682547,589,00038,852,0002,113,536
3Jun 8, 2026 00:1217,833597,701,618550,361,00038,145,0002,113,536
4Jun 8, 2026 00:1217,842597,972,012550,522,00038,291,0002,113,536
5Jun 8, 2026 00:1217,910600,169,216552,358,00038,674,0002,113,536
6Jun 8, 2026 00:1217,951601,571,162554,221,00038,176,0002,113,536
7Jun 8, 2026 00:1217,987602,619,745554,579,00038,997,0002,113,536
8Jun 8, 2026 00:1218,027603,944,023556,285,00038,616,0002,113,536
9Jun 8, 2026 00:1218,314613,577,299566,115,00038,273,0002,113,536