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 21, 2026 11:32Dominique GarmierDominique GarmierScore: 12,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 11:3212,834133,696,456104,236,0001,002,0002,330,624
2Mar 21, 2026 11:3012,853133,943,272104,404,000994,0002,416,640
3Mar 21, 2026 11:3112,854136,040,571104,398,0001,003,0002,494,464
4Mar 21, 2026 11:3112,858131,974,783105,432,00002,289,664
5Mar 21, 2026 11:3012,873133,099,017103,549,0002,010,0002,527,232
6Mar 21, 2026 11:3012,875137,244,260104,571,0001,005,0002,531,328
7Mar 21, 2026 11:3212,878131,161,635103,590,0002,011,0002,334,720
8Mar 21, 2026 11:3112,896130,652,642103,752,0001,995,0002,330,624
9Mar 21, 2026 11:3212,909132,464,245103,854,0001,997,0002,301,952