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 20:47highloadLLMhighloadLLMScore: 19,500Success
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 20:4919,175642,006,245593,963,00038,818,0002,113,536
2Jun 7, 2026 20:4919,459651,327,170603,053,00039,120,0002,113,536
3Jun 7, 2026 20:4919,467651,669,470603,187,00039,240,0002,113,536
4Jun 7, 2026 20:4919,497652,619,679605,570,00037,852,0002,113,536
5Jun 7, 2026 20:4919,500652,783,086604,800,00038,730,0002,113,536
6Jun 7, 2026 20:4919,573655,188,940607,193,00038,747,0002,113,536
7Jun 7, 2026 20:4919,582655,520,300607,110,00039,100,0002,113,536
8Jun 7, 2026 20:4919,713659,597,809611,023,00039,520,0002,113,536
9Jun 7, 2026 20:4919,740660,620,976612,372,00039,077,0002,113,536