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 04:09highloadLLMhighloadLLMScore: 14,673Success
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 04:1014,651492,704,659377,341,000106,173,0002,113,536
2Jun 8, 2026 04:1014,663493,060,415377,676,000106,213,0002,113,536
3Jun 8, 2026 04:1014,668493,314,249376,822,000107,244,0002,113,536
4Jun 8, 2026 04:1014,673493,409,737377,337,000106,891,0002,113,536
5Jun 8, 2026 04:1014,673493,478,626376,565,000107,672,0002,113,536
6Jun 8, 2026 04:1014,700494,252,085377,338,000107,783,0002,113,536
7Jun 8, 2026 04:1014,704494,383,468377,724,000107,535,0002,113,536
8Jun 8, 2026 04:1014,773496,649,487378,410,000109,131,0002,113,536
9Jun 8, 2026 04:1014,791497,278,824377,325,000110,800,0002,113,536