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 15:49highloadLLMhighloadLLMScore: 57,750Success
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 15:5157,1301,894,666,5851,825,049,00060,246,0002,113,536
2Jun 7, 2026 15:5157,4081,903,679,6351,835,062,00059,403,0002,113,536
3Jun 7, 2026 15:5157,5981,910,067,1411,842,773,00057,993,0002,113,536
4Jun 7, 2026 15:5157,6801,912,658,9741,845,973,00057,479,0002,113,536
5Jun 7, 2026 15:5157,7501,916,403,4991,845,321,00060,448,0002,113,536
6Jun 7, 2026 15:5157,7621,915,428,6381,848,566,00057,606,0002,113,536
7Jun 7, 2026 15:5157,9271,920,776,0541,853,769,00057,830,0002,113,536
8Jun 7, 2026 15:5158,1391,928,070,9821,861,078,00057,533,0002,113,536
9Jun 7, 2026 15:5158,2691,931,983,5961,865,067,00057,821,0002,113,536