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 13:15marko1597marko1597Score: 7,502Success
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 13:372,89231,986,48121,581,0002,141,0002,117,632stderr
2Aug 16, 2026 13:372,89732,038,53521,613,0002,147,0002,117,632stderr
3Aug 16, 2026 13:372,90132,120,61321,640,0002,154,0002,117,632stderr
4Aug 16, 2026 13:372,91932,287,29821,793,0002,147,0002,117,632stderr
5Aug 16, 2026 13:377,50269,795,54958,454,0003,070,0002,117,632stderr
6Aug 16, 2026 13:377,52469,971,08359,621,0002,079,0002,117,632stderr
7Aug 16, 2026 13:377,58270,483,20959,016,0003,160,0002,117,632stderr
8Aug 16, 2026 13:377,60970,779,25759,299,0003,095,0002,117,632stderr
9Aug 16, 2026 13:377,65172,232,52859,624,0003,117,0002,117,632stderr