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 12:30olliecrowolliecrowScore: 3,472Success
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 12:313,35045,990,73026,455,0001,017,0002,326,528
2Apr 25, 2026 12:313,39943,960,01624,888,0002,986,0002,494,464
3Apr 25, 2026 12:313,40746,353,41825,943,0001,995,0002,424,832
4Apr 25, 2026 12:313,41746,344,09626,020,0002,001,0002,441,216
5Apr 25, 2026 12:313,47243,979,78427,461,0001,017,0002,494,464
6Apr 25, 2026 12:313,47444,597,82025,436,0003,052,0002,322,432
7Apr 25, 2026 12:3123,969214,290,395193,553,0002,993,0002,514,944
8Apr 25, 2026 12:3123,983216,751,438192,675,0003,993,0002,547,712
9Apr 25, 2026 12:3124,261223,311,412195,943,0002,999,0002,502,656