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 17:23highloadLLMhighloadLLMScore: 29,283Success
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 17:2429,150971,248,928921,036,00040,936,0002,113,536
2Jun 7, 2026 17:2429,191972,552,060922,209,00041,125,0002,113,536
3Jun 7, 2026 17:2429,206973,077,714922,947,00040,863,0002,113,536
4Jun 7, 2026 17:2429,224973,714,378922,753,00041,662,0002,113,536
5Jun 7, 2026 17:2429,283975,578,261924,839,00041,514,0002,113,536
6Jun 7, 2026 17:2429,365978,333,404927,669,00041,387,0002,113,536
7Jun 7, 2026 17:2429,367978,337,066927,819,00041,292,0002,113,536
8Jun 7, 2026 17:2429,446980,834,073929,957,00041,781,0002,113,536
9Jun 7, 2026 17:2429,543984,156,339933,034,00041,913,0002,113,536