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 14, 2026 17:18marko1597marko1597Score: 597,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:19595,4444,892,639,5684,879,412,0003,236,0002,117,632stderr
2Aug 14, 2026 17:19596,0714,898,021,9994,883,360,0004,429,0002,117,632stderr
3Aug 14, 2026 17:19596,8684,904,749,0934,888,959,0005,366,0002,117,632stderr
4Aug 14, 2026 17:19597,6234,910,500,9494,897,221,0003,289,0002,117,632stderr
5Aug 14, 2026 17:19597,7054,911,404,4414,897,710,0003,475,0002,117,632stderr
6Aug 14, 2026 17:19597,7914,911,850,6394,898,657,0003,232,0002,117,632stderr
7Aug 14, 2026 17:19598,1424,914,750,8334,901,566,0003,199,0002,117,632stderr
8Aug 14, 2026 17:19598,3964,916,938,5744,903,356,0003,497,0002,117,632stderr
9Aug 14, 2026 17:19598,5594,918,216,0314,904,737,0003,451,0002,117,632stderr