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 listOct 12, 2024 22:18zielajzielajScore: 973,644Success
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, 2024 22:18968,8207,980,431,3317,740,499,000203,828,0002,310,144
2Oct 12, 2024 22:18972,4288,009,586,2137,765,069,000208,840,0002,383,872
3Oct 12, 2024 22:18972,5268,008,478,9277,765,903,000208,809,0002,281,472
4Oct 12, 2024 22:18972,8838,010,207,6477,758,845,000218,798,0002,301,952
5Oct 12, 2024 22:18973,6448,017,997,6817,790,054,000193,827,0002,498,560
6Oct 12, 2024 22:18973,7168,021,442,5707,772,645,000211,826,0002,306,048
7Oct 12, 2024 22:18973,7348,024,267,3327,770,820,000213,802,0002,441,216
8Oct 12, 2024 22:18975,8268,033,485,2707,784,967,000216,804,0002,281,472
9Oct 12, 2024 22:18976,2008,038,012,3287,800,002,000204,842,0002,281,472