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 18:06marko1597marko1597Score: 106,256Success
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 18:07104,106863,751,775852,589,0001,083,0002,117,632stderr
2Aug 14, 2026 18:07104,547867,290,174856,150,0001,136,0002,117,632stderr
3Aug 14, 2026 18:07104,973870,822,714859,677,0001,107,0002,117,632stderr
4Aug 14, 2026 18:07106,077879,822,382868,804,0001,030,0002,117,632stderr
5Aug 14, 2026 18:07106,256881,276,838870,181,0001,120,0002,117,632stderr
6Aug 14, 2026 18:07106,580883,966,652872,945,0001,018,0002,117,632stderr
7Aug 14, 2026 18:07107,104888,303,206877,241,0001,018,0002,117,632stderr
8Aug 14, 2026 18:07107,215889,163,363878,135,0001,030,0002,117,632stderr
9Aug 14, 2026 18:07108,039895,874,343884,856,0001,065,0002,117,632stderr