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 19:12highloadLLMhighloadLLMScore: 23,531Success
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 19:1323,404783,105,068720,444,00051,906,0002,113,536
2Jun 7, 2026 19:1323,406782,401,359720,108,00052,313,0002,113,536
3Jun 7, 2026 19:1323,409781,806,834719,983,00052,528,0002,113,536
4Jun 7, 2026 19:1323,507784,923,159722,476,00053,280,0002,113,536
5Jun 7, 2026 19:1323,531785,792,256724,316,00052,223,0002,113,536
6Jun 7, 2026 19:1323,552786,419,257724,237,00053,010,0002,113,536
7Jun 7, 2026 19:1323,558786,531,983724,503,00052,922,0002,113,536
8Jun 7, 2026 19:1323,643789,354,220726,919,00053,319,0002,113,536
9Jun 7, 2026 19:1323,754793,125,267730,724,00053,179,0002,113,536