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:54highloadLLMhighloadLLMScore: 10,984Success
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:5510,885368,943,561324,993,00034,243,0002,113,536
2Jun 8, 2026 06:5510,900369,136,636325,200,00034,531,0002,117,632
3Jun 8, 2026 06:5510,951370,694,834326,742,00034,645,0002,117,632
4Jun 8, 2026 06:5510,969371,206,766327,009,00034,975,0002,117,632
5Jun 8, 2026 06:5510,984371,858,433326,632,00035,870,0002,117,632
6Jun 8, 2026 06:5511,008372,494,422326,994,00036,293,0002,117,632
7Jun 8, 2026 06:5511,044374,305,739329,654,00034,828,0002,117,632
8Jun 8, 2026 06:5511,052374,502,325328,219,00036,514,0002,117,632
9Jun 8, 2026 06:5511,078374,854,314330,454,00035,150,0002,113,536