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 listMar 22, 2026 14:53Dominique GarmierDominique GarmierScore: 29,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 14:5228,339255,331,948231,377,0001,001,0002,293,760
2Mar 22, 2026 14:5228,807263,876,143234,214,0002,001,0002,277,376
3Mar 22, 2026 14:5328,932264,753,598236,242,0001,001,0002,269,184
4Mar 22, 2026 14:5229,428267,690,724239,305,0002,002,0002,527,232
5Mar 22, 2026 14:5330,008275,860,642244,066,0002,000,0002,289,664
6Mar 22, 2026 14:5330,201275,367,992247,651,00002,293,760