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 00:15highloadLLMhighloadLLMScore: 17,613Success
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 00:1617,219577,470,345530,320,00037,929,0002,113,536
2Jun 8, 2026 00:1617,253578,538,957530,335,00039,022,0002,113,536
3Jun 8, 2026 00:1617,438584,652,239537,189,00038,287,0002,113,536
4Jun 8, 2026 00:1617,568588,916,251541,784,00037,986,0002,113,536
5Jun 8, 2026 00:1617,613590,324,075542,381,00038,853,0002,113,536
6Jun 8, 2026 00:1617,773595,567,808547,655,00038,875,0002,113,536
7Jun 8, 2026 00:1617,832597,760,573550,377,00038,107,0002,113,536
8Jun 8, 2026 00:1617,897601,165,451552,739,00037,886,0002,113,536
9Jun 8, 2026 00:1618,014603,545,482556,092,00038,389,0002,113,536