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 02:58highloadLLMhighloadLLMScore: 16,257Success
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 02:5916,070539,385,570423,867,000106,475,0002,113,536
2Jun 8, 2026 02:5916,117541,002,256424,711,000107,166,0002,113,536
3Jun 8, 2026 02:5916,148542,257,249425,486,000107,427,0002,113,536
4Jun 8, 2026 02:5916,171542,847,185428,238,000105,415,0002,113,536
5Jun 8, 2026 02:5916,257545,760,180430,310,000106,174,0002,113,536
6Jun 8, 2026 02:5916,260547,057,928428,298,000108,283,0002,113,536
7Jun 8, 2026 02:5916,311547,401,637432,942,000105,340,0002,113,536
8Jun 8, 2026 02:5916,332548,068,520428,682,000110,303,0002,113,536
9Jun 8, 2026 02:5916,373549,478,226432,522,000107,801,0002,113,536