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 12, 2025 02:51Marco BarboneMarco BarboneScore: 104,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 02:51104,1793,472,706,5123,422,908,00014,990,0002,273,280
2Oct 12, 2025 02:51104,2333,468,383,4043,419,688,00019,986,0002,273,280
3Oct 12, 2025 02:51104,2443,475,740,0853,427,065,00012,992,0002,535,424
4Oct 12, 2025 02:51104,7803,490,726,1303,441,762,00015,989,0002,338,816
5Oct 12, 2025 02:51104,7903,484,791,3583,441,066,00016,990,0002,408,448
6Oct 12, 2025 02:51105,0063,496,811,9553,444,218,00020,989,0002,334,720
7Oct 12, 2025 02:51105,2553,506,534,5793,458,416,00014,988,0002,535,424
8Oct 12, 2025 02:51105,4323,509,222,7613,464,270,00014,988,0002,494,464
9Oct 12, 2025 02:51106,0763,539,451,7983,484,524,00015,984,0002,306,048