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:38highloadLLMhighloadLLMScore: 24,182Success
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:4024,032802,297,956740,588,00052,477,0002,113,536
2Jun 7, 2026 17:4024,033802,437,982740,328,00052,773,0002,113,536
3Jun 7, 2026 17:4024,072803,622,403742,620,00051,760,0002,113,536
4Jun 7, 2026 17:4024,078803,852,139742,302,00052,304,0002,113,536
5Jun 7, 2026 17:4024,182807,114,530744,753,00053,256,0002,113,536
6Jun 7, 2026 17:4024,184807,201,966745,105,00052,978,0002,113,536
7Jun 7, 2026 17:4024,252809,522,224747,880,00052,456,0002,113,536
8Jun 7, 2026 17:4024,282810,445,054749,429,00051,880,0002,113,536
9Jun 7, 2026 17:4024,344812,460,029749,439,00053,917,0002,113,536