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 11:24marko1597marko1597Score: 376,517Success
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 11:45375,3703,087,932,3563,076,923,0001,115,0002,117,632stderr
2Aug 16, 2026 11:45375,8673,092,229,9923,081,080,0001,030,0002,117,632stderr
3Aug 16, 2026 11:45376,2133,094,866,2423,083,920,0001,029,0002,117,632stderr
4Aug 16, 2026 11:45376,3213,095,836,9833,084,815,0001,023,0002,117,632stderr
5Aug 16, 2026 11:45376,5173,097,404,1683,086,225,0001,221,0002,117,632stderr
6Aug 16, 2026 11:45376,6343,099,873,5273,087,197,0001,206,0002,117,632stderr
7Aug 16, 2026 11:45376,9353,101,437,2313,088,764,0002,109,0002,117,632stderr
8Aug 16, 2026 11:45376,9743,101,053,5823,090,081,0001,107,0002,125,824stderr
9Aug 16, 2026 11:45380,7103,131,769,9503,120,798,0001,029,0002,117,632stderr