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 listMay 11, 2026 17:02Victor MerckléVictor MerckléScore: 3,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 17:033,49040,420,61327,569,0001,052,0002,113,536
2May 11, 2026 17:033,50039,842,07327,635,0001,066,0002,113,536
3May 11, 2026 17:033,50438,665,11227,671,0001,068,0002,113,536
4May 11, 2026 17:033,51039,948,95027,724,0001,061,0002,113,536
5May 11, 2026 17:033,52339,419,41126,813,0002,076,0002,113,536
6May 11, 2026 17:0313,532122,648,110108,944,0002,026,0002,113,536
7May 11, 2026 17:0313,584123,236,334109,376,0002,020,0002,113,536
8May 11, 2026 17:0313,607120,466,263109,554,0002,024,0002,113,536
9May 11, 2026 17:0313,763124,261,294110,846,0002,016,0002,113,536