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 4, 2026 17:00olliecrowolliecrowScore: 12,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 17:0012,130125,836,03498,465,0001,004,0002,420,736
2Mar 4, 2026 17:0012,133124,462,78298,488,0001,004,0002,416,640
3Mar 4, 2026 17:0012,139128,471,93796,522,0003,016,0002,453,504
4Mar 4, 2026 17:0012,146125,952,01097,604,0001,991,0002,416,640
5Mar 4, 2026 17:0012,146132,560,55196,583,0003,018,0002,437,120
6Mar 4, 2026 17:0012,161126,805,99397,730,0001,994,0002,412,544
7Mar 4, 2026 17:0012,162129,659,81595,737,0003,989,0002,416,640
8Mar 4, 2026 17:0012,166131,488,49798,768,000997,0002,424,832
9Mar 4, 2026 17:0012,213130,894,61598,145,0002,002,0002,449,408