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 listApr 24, 2025 14:34Emanuele BolognesiEmanuele BolognesiScore: 41,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 14:3440,713358,992,769210,903,000122,944,0002,392,064
2Apr 24, 2025 14:3440,859362,547,928215,028,000120,015,0002,297,856
3Apr 24, 2025 14:3440,922366,556,667222,706,000112,851,0002,400,256
4Apr 24, 2025 14:3441,178359,311,410222,774,000114,883,0002,490,368
5Apr 24, 2025 14:3441,317365,950,085218,868,000119,928,0002,404,352
6Apr 24, 2025 14:3441,504370,411,045211,587,000128,748,0002,338,816
7Apr 24, 2025 14:3441,682368,641,825211,873,000129,922,0002,461,696
8Apr 24, 2025 14:3442,224374,978,980218,516,000127,717,0002,396,160
9Apr 24, 2025 14:3442,737378,599,863229,637,000120,809,0002,482,176