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 17, 2026 03:23e1011e1011Score: 209,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 03:25207,4506,857,329,6596,842,873,0003,001,0002,121,728
2Oct 17, 2026 03:25208,2146,882,588,4496,869,082,0002,003,0002,121,728
3Oct 17, 2026 03:25208,5066,892,403,0036,877,544,0003,163,0002,121,728
4Oct 17, 2026 03:25208,8716,904,254,4016,890,763,0002,011,0002,121,728
5Oct 17, 2026 03:25209,2876,919,900,6606,904,484,0002,008,0002,121,728
6Oct 17, 2026 03:25211,9917,007,043,9676,992,719,0003,013,0002,121,728
7Oct 17, 2026 03:25212,5727,025,960,0037,011,840,0003,039,0002,121,728
8Oct 17, 2026 03:25213,7657,065,142,1667,051,153,0003,123,0002,121,728
9Oct 17, 2026 03:25217,8267,199,187,7257,186,275,0002,002,0002,121,728