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 listSep 3, 2026 05:15Josu San MartinJosu San MartinScore: 3,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 05:163,57839,332,72328,308,0001,032,0002,113,536
2Sep 3, 2026 05:163,58739,526,78528,360,0001,059,0002,113,536
3Sep 3, 2026 05:163,59040,253,71728,394,0001,047,0002,113,536
4Sep 3, 2026 05:163,61340,415,52528,573,0001,060,0002,113,536
5Sep 3, 2026 05:163,62239,784,87328,641,0001,061,0002,113,536
6Sep 3, 2026 05:1610,46995,908,05880,470,0005,382,0002,113,536
7Sep 3, 2026 05:1610,62197,136,31381,646,0005,453,0002,113,536
8Sep 3, 2026 05:1620,943182,500,576165,139,0006,594,0002,117,632
9Sep 3, 2026 05:1621,268184,461,610167,836,0006,563,0002,117,632