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 23:41marko1597marko1597Score: 2,897Success
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 23:542,87732,003,26822,428,0001,167,0002,117,632stderr
2Aug 15, 2026 23:542,88532,095,27922,371,0001,291,0002,117,632stderr
3Aug 15, 2026 23:542,88832,170,07622,411,0001,273,0002,117,632stderr
4Aug 15, 2026 23:542,89732,189,51222,482,0001,279,0002,117,632stderr
5Aug 15, 2026 23:542,89731,951,24222,722,0001,037,0002,117,632stderr
6Aug 15, 2026 23:542,96932,813,41423,170,0001,182,0002,117,632stderr
7Aug 15, 2026 23:545,36652,488,23142,828,0001,181,0002,117,632stderr
8Aug 15, 2026 23:547,06466,424,84956,741,0001,189,0002,117,632stderr
9Aug 15, 2026 23:547,09366,604,58456,969,0001,195,0002,117,632stderr