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 31, 2026 01:05Andrew EpsteinAndrew EpsteinScore: 2,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 01:162,747101,479,45088,617,0002,045,0002,134,016
2Oct 31, 2026 01:162,755101,559,89388,883,0002,059,0002,134,016
3Oct 31, 2026 01:162,765101,920,69989,107,0002,150,0002,129,920
4Oct 31, 2026 01:162,773102,187,49989,423,0002,106,0002,129,920
5Oct 31, 2026 01:162,779102,370,70589,644,0002,081,0002,129,920
6Oct 31, 2026 01:162,786102,633,58289,889,0002,062,0002,134,016
7Oct 31, 2026 01:162,794102,868,57290,182,0002,047,0002,174,976
8Oct 31, 2026 01:162,809103,379,49090,665,0002,062,0002,134,016
9Oct 31, 2026 01:162,818103,718,32190,923,0002,079,0002,129,920