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 06:38highloadLLMhighloadLLMScore: 11,194Success
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 06:3911,168377,645,111334,828,00033,726,0002,117,632
2Jun 8, 2026 06:3911,174380,350,228335,164,00033,605,0002,117,632
3Jun 8, 2026 06:3911,174377,911,897334,885,00033,861,0002,117,632
4Jun 8, 2026 06:3911,180378,115,406335,118,00033,846,0002,117,632
5Jun 8, 2026 06:3911,194378,675,248335,387,00034,025,0002,117,632
6Jun 8, 2026 06:3911,194378,496,317335,380,00034,040,0002,117,632
7Jun 8, 2026 06:3911,223379,534,623336,434,00033,935,0002,113,536
8Jun 8, 2026 06:3911,235380,140,914335,164,00035,603,0002,117,632
9Jun 8, 2026 06:3911,238380,049,991336,461,00034,411,0002,117,632