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 25, 2026 14:40olliecrowolliecrowScore: 20,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 14:4112,508117,020,584101,565,0001,005,0002,560,000
2Apr 25, 2026 14:4112,516122,876,441101,632,0001,006,0002,551,808
3Apr 25, 2026 14:4112,518116,821,91099,665,0002,989,0002,285,568
4Apr 25, 2026 14:4112,528119,340,020100,739,0001,994,0002,301,952
5Apr 25, 2026 14:4120,736185,995,495167,040,0003,000,0002,326,528
6Apr 25, 2026 14:4120,761187,779,790167,243,0003,004,0002,301,952
7Apr 25, 2026 14:4120,767187,373,633168,288,0002,003,0002,527,232
8Apr 25, 2026 14:4120,793190,848,582166,498,0004,012,0002,326,528
9Apr 25, 2026 14:4120,964192,580,592168,911,0002,998,0002,351,104