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 1, 2026 13:48Victor MerckléVictor MerckléScore: 2,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 13:482,62329,641,35920,493,0001,020,0002,117,632stderr
2Sep 1, 2026 13:482,62429,890,55920,501,0001,017,0002,117,632stderr
3Sep 1, 2026 13:482,62829,934,53520,535,0001,016,0002,117,632stderr
4Sep 1, 2026 13:482,63430,021,76420,572,0001,027,0002,117,632stderr
5Sep 1, 2026 13:482,63430,616,22520,563,0001,036,0002,117,632stderr
6Sep 1, 2026 13:482,63529,748,95520,586,0001,025,0002,117,632stderr
7Sep 1, 2026 13:482,63930,774,62120,616,0001,028,0002,117,632stderr
8Sep 1, 2026 13:482,63930,681,68120,607,0001,034,0002,117,632stderr
9Sep 1, 2026 13:4815,032131,681,896122,257,0001,012,0002,117,632stderr