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 06:18highloadLLMhighloadLLMScore: 10,405Success
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 06:1910,338350,410,914306,955,00034,205,0002,117,632
2Jun 8, 2026 06:1910,392352,235,448308,885,00034,057,0002,117,632
3Jun 8, 2026 06:1910,395352,303,760308,356,00034,704,0002,117,632
4Jun 8, 2026 06:1910,398352,497,209308,657,00034,497,0002,117,632
5Jun 8, 2026 06:1910,405352,653,669308,883,00034,492,0002,117,632
6Jun 8, 2026 06:1910,416353,512,866309,106,00034,648,0002,117,632
7Jun 8, 2026 06:1910,427353,400,667309,949,00034,147,0002,117,632
8Jun 8, 2026 06:1910,451354,154,198310,664,00034,221,0002,117,632
9Jun 8, 2026 06:1910,978373,970,881327,188,00035,107,0002,117,632