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 23:51highloadLLMhighloadLLMScore: 19,399Success
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 23:5319,168641,778,120595,078,00037,486,0002,113,536
2Jun 7, 2026 23:5319,221643,467,211595,919,00038,393,0002,113,536
3Jun 7, 2026 23:5319,364648,230,199601,004,00038,013,0002,113,536
4Jun 7, 2026 23:5319,394649,109,509601,686,00038,327,0002,113,536
5Jun 7, 2026 23:5319,399649,340,915601,281,00038,913,0002,113,536
6Jun 7, 2026 23:5319,451651,761,521603,228,00038,678,0002,113,536
7Jun 7, 2026 23:5319,532653,735,477606,163,00038,415,0002,113,536
8Jun 7, 2026 23:5319,658657,943,657610,394,00038,338,0002,113,536
9Jun 7, 2026 23:5319,678658,620,204611,158,00038,234,0002,113,536