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 listMar 23, 2026 14:26Dominique GarmierDominique GarmierScore: 10,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 14:2610,050107,589,79781,408,0001,005,0002,387,968
2Mar 23, 2026 14:2610,052105,231,77181,421,0001,005,0002,273,280
3Mar 23, 2026 14:2610,070113,332,71781,579,000994,0002,273,280
4Mar 23, 2026 14:2610,071110,254,71581,572,0001,007,0002,273,280
5Mar 23, 2026 14:2610,096110,953,24379,799,0002,992,0002,396,160
6Mar 23, 2026 14:2610,098108,690,19180,806,0001,995,0002,387,968
7Mar 23, 2026 14:2610,120104,423,16980,982,0001,999,0002,396,160
8Mar 23, 2026 14:2610,121109,153,46380,992,0001,999,0002,273,280
9Mar 23, 2026 14:2612,979125,433,964105,427,0001,004,0002,273,280