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:31highloadLLMhighloadLLMScore: 19,757Success
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:3219,502652,800,894604,884,00038,683,0002,113,536
2Jun 7, 2026 20:3219,549654,424,807606,199,00038,929,0002,113,536
3Jun 7, 2026 20:3219,639657,297,014608,988,00039,115,0002,113,536
4Jun 7, 2026 20:3219,676658,444,161610,532,00038,804,0002,113,536
5Jun 7, 2026 20:3219,757661,208,436613,025,00038,988,0002,113,536
6Jun 7, 2026 20:3219,789662,282,573613,457,00039,610,0002,113,536
7Jun 7, 2026 20:3219,801662,668,507614,893,00038,572,0002,113,536
8Jun 7, 2026 20:3219,847664,140,274615,916,00039,051,0002,113,536
9Jun 7, 2026 20:3219,887665,490,265616,991,00039,295,0002,113,536