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 19:40highloadLLMhighloadLLMScore: 22,259Success
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 19:4122,182741,237,194673,791,00058,231,0002,113,536
2Jun 7, 2026 19:4122,207742,164,896674,980,00057,880,0002,113,536
3Jun 7, 2026 19:4122,218742,402,263675,159,00058,042,0002,113,536
4Jun 7, 2026 19:4122,256743,554,125675,723,00058,753,0002,113,536
5Jun 7, 2026 19:4122,259746,182,612676,384,00058,188,0002,113,536
6Jun 7, 2026 19:4122,299745,033,387678,468,00057,410,0002,113,536
7Jun 7, 2026 19:4122,371747,452,603680,268,00057,975,0002,113,536
8Jun 7, 2026 19:4122,390748,020,062680,892,00057,980,0002,113,536
9Jun 7, 2026 19:4122,601757,058,212687,310,00058,532,0002,113,536