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 21:53highloadLLMhighloadLLMScore: 21,040Success
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 21:5720,865697,851,160649,568,00038,990,0002,113,536
2Jun 7, 2026 21:5720,947700,543,575651,595,00039,664,0002,113,536
3Jun 7, 2026 21:5721,018702,871,152653,729,00039,867,0002,113,536
4Jun 7, 2026 21:5721,038704,139,794654,553,00039,707,0002,113,536
5Jun 7, 2026 21:5721,040704,005,534655,168,00039,157,0002,113,536
6Jun 7, 2026 21:5721,069704,738,429656,639,00038,654,0002,113,536
7Jun 7, 2026 21:5721,161708,130,066659,065,00039,255,0002,113,536
8Jun 7, 2026 21:5721,235710,339,261661,267,00039,500,0002,113,536
9Jun 7, 2026 21:5721,396715,334,874666,783,00039,317,0002,113,536