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 18:28highloadLLMhighloadLLMScore: 27,038Success
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 18:2926,888896,356,900838,457,00048,853,0002,113,536
2Jun 7, 2026 18:2926,906897,146,223839,341,00048,564,0002,113,536
3Jun 7, 2026 18:2926,985899,723,615841,533,00048,977,0002,113,536
4Jun 7, 2026 18:2926,998900,149,675841,511,00049,426,0002,113,536
5Jun 7, 2026 18:2927,038901,552,726843,029,00049,235,0002,113,536
6Jun 7, 2026 18:2927,117904,021,502845,026,00049,852,0002,113,536
7Jun 7, 2026 18:2927,137904,694,292845,995,00049,536,0002,113,536
8Jun 7, 2026 18:2927,204907,161,007848,342,00049,412,0002,113,536
9Jun 7, 2026 18:2927,269909,010,995850,112,00049,778,0002,113,536