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 11:48highloadLLMhighloadLLMScore: 10,836Success
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 11:4910,807366,324,803321,714,00034,931,0002,117,632
2Jun 8, 2026 11:4910,817366,253,791322,744,00034,234,0002,117,632
3Jun 8, 2026 11:4910,821366,426,719321,604,00035,513,0002,117,632
4Jun 8, 2026 11:4910,821366,476,223322,673,00034,441,0002,117,632
5Jun 8, 2026 11:4910,836367,405,617322,101,00035,519,0002,117,632
6Jun 8, 2026 11:4910,864367,808,193323,955,00034,562,0002,117,632
7Jun 8, 2026 11:4910,882368,894,680324,473,00034,656,0002,117,632
8Jun 8, 2026 11:4910,926370,336,408325,197,00035,377,0002,117,632
9Jun 8, 2026 11:4910,940370,271,578326,396,00034,636,0002,117,632