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 listJan 11, 2026 01:28zielajzielajScore: 3,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 01:282,964121,071,84795,820,0001,996,0002,535,424
2Jan 11, 2026 01:283,014121,870,47897,446,0002,009,0002,412,544
3Jan 11, 2026 01:283,033119,798,33798,097,0002,001,0002,387,968
4Jan 11, 2026 01:283,055128,194,57098,807,0001,996,0002,535,424
5Jan 11, 2026 01:283,065126,170,60699,146,0002,002,0002,404,352
6Jan 11, 2026 01:283,075126,270,82299,454,0002,009,0002,412,544
7Jan 11, 2026 01:283,101120,285,002100,330,0002,006,0002,535,424
8Jan 11, 2026 01:283,102128,259,702100,372,0002,007,0002,535,424
9Jan 11, 2026 01:283,128127,581,299101,227,0002,004,0002,535,424