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 listMay 1, 2026 11:08Pavel SkripkinPavel SkripkinScore: 16,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 11:0915,893541,398,977415,597,000108,894,0002,420,736
2May 1, 2026 11:0916,068548,968,269423,420,000106,853,0002,494,464
3May 1, 2026 11:0916,221550,569,263429,443,000105,862,0002,457,600
4May 1, 2026 11:0916,372553,395,692426,448,000113,852,0002,412,544
5May 1, 2026 11:0916,474556,587,020435,735,000107,934,0002,457,600
6May 1, 2026 11:0916,802570,837,266445,595,000108,901,0002,535,424
7May 1, 2026 11:0916,911573,656,291452,242,000105,822,0002,531,328
8May 1, 2026 11:0917,079582,663,674451,699,000111,925,0002,359,296
9May 1, 2026 11:0917,936612,009,450486,909,000104,980,0002,486,272