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 listJan 22, 2025 20:46Oleg KovalovOleg KovalovScore: 100,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 20:4684,365720,348,616496,849,000194,940,0002,445,312
2Jan 22, 2025 20:4688,101754,396,169531,582,000190,849,0002,396,160
3Jan 22, 2025 20:4688,461752,382,256528,547,000196,831,0002,281,472
4Jan 22, 2025 20:4696,247821,849,992599,413,000189,814,0002,281,472
5Jan 22, 2025 20:46100,663848,862,029625,573,000199,863,0002,289,664
6Jan 22, 2025 20:46109,646926,559,478709,291,000189,810,0002,301,952
7Jan 22, 2025 20:46115,384975,894,527752,322,000193,825,0002,392,064
8Jan 22, 2025 20:46116,238981,550,708757,328,000195,826,0002,289,664
9Jan 22, 2025 20:46116,3181,021,572,415751,753,000202,052,0002,281,472