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 15, 2026 21:52marko1597marko1597Score: 398,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 21:56394,0563,241,289,7023,230,229,0001,031,0002,117,632stderr
2Aug 15, 2026 21:56395,5023,253,087,4543,242,090,0001,028,0002,117,632stderr
3Aug 15, 2026 21:56396,7833,263,665,2703,251,594,0002,031,0002,117,632stderr
4Aug 15, 2026 21:56397,0613,265,893,2003,254,793,0001,109,0002,117,632stderr
5Aug 15, 2026 21:56398,3963,278,369,6763,265,778,0001,071,0002,117,632stderr
6Aug 15, 2026 21:56399,8223,289,820,2773,277,500,0001,048,0002,117,632stderr
7Aug 15, 2026 21:56400,4663,293,698,4753,282,790,0001,034,0002,117,632stderr
8Aug 15, 2026 21:56401,0913,298,910,9113,287,928,0001,022,0002,117,632stderr
9Aug 15, 2026 21:56401,7473,304,364,4903,293,102,0001,231,0002,117,632stderr