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 4, 2026 06:27Josu San MartinJosu San MartinScore: 3,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 06:273,04634,870,03723,941,0001,040,0002,121,728stderr
2Sep 4, 2026 06:273,04734,872,20623,951,0001,039,0002,121,728stderr
3Sep 4, 2026 06:273,04834,921,25123,975,0001,026,0002,121,728stderr
4Sep 4, 2026 06:273,04835,669,83823,944,0001,052,0002,121,728stderr
5Sep 4, 2026 06:273,06335,121,82724,096,0001,028,0002,121,728stderr
6Sep 4, 2026 06:273,07435,064,73124,179,0001,033,0002,121,728stderr
7Sep 4, 2026 06:273,12636,288,90624,611,0001,030,0002,121,728stderr
8Sep 4, 2026 06:2715,235134,838,755123,925,0001,005,0002,121,728stderr
9Sep 4, 2026 06:2715,319135,578,289124,602,0001,016,0002,121,728stderr