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 listMar 21, 2026 08:11olliecrowolliecrowScore: 95,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 08:1092,7313,090,886,4153,009,156,00050,968,0002,535,424
2Mar 21, 2026 08:1093,3933,111,002,0083,042,992,00038,974,0002,396,160
3Mar 21, 2026 08:1194,4263,151,986,4463,075,090,00040,974,0002,408,448
4Mar 21, 2026 08:1195,2603,173,267,0173,100,605,00042,980,0002,383,872
5Mar 21, 2026 08:1196,2333,207,908,7123,125,723,00049,979,0002,338,816
6Mar 21, 2026 08:1097,1313,236,775,9103,162,367,00042,964,0002,359,296