Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listAug 16, 2026 12:51marko1597marko1597Score: 39,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 12:5438,813328,157,470317,252,0001,021,0002,117,632stderr
2Aug 16, 2026 12:5439,102330,734,791319,467,0001,172,0002,117,632stderr
3Aug 16, 2026 12:5439,250332,037,414320,826,0001,027,0002,117,632stderr
4Aug 16, 2026 12:5439,494333,697,174322,851,0001,004,0002,117,632stderr
5Aug 16, 2026 12:5439,527334,017,993322,954,0001,170,0002,117,632stderr
6Aug 16, 2026 12:5439,864336,699,662325,771,0001,118,0002,117,632stderr
7Aug 16, 2026 12:5440,092346,567,913327,757,0001,002,0002,117,632stderr
8Aug 16, 2026 12:5440,839344,700,267333,863,0001,021,0002,117,632stderr
9Aug 16, 2026 12:5440,964345,886,941334,846,0001,063,0002,117,632stderr