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 listOct 18, 2026 22:57e1011e1011Score: 29,150Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2026 23:0228,958966,672,726923,922,00031,693,0002,113,536
2Oct 18, 2026 23:0229,042969,699,953926,295,00032,112,0002,113,536
3Oct 18, 2026 23:0229,073970,426,087927,320,00032,107,0002,113,536
4Oct 18, 2026 23:0229,101971,314,369928,312,00032,021,0002,113,536
5Oct 18, 2026 23:0229,150973,377,784931,332,00030,637,0002,113,536
6Oct 18, 2026 23:0229,178974,309,468930,839,00032,039,0002,113,536
7Oct 18, 2026 23:0229,236975,844,538933,584,00031,226,0002,113,536
8Oct 18, 2026 23:0229,250976,261,755933,124,00032,151,0002,113,536
9Oct 18, 2026 23:0229,283977,412,564935,418,00030,928,0002,113,536