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 24, 2026 20:02Arseniy KorobenkoArseniy KorobenkoScore: 118,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 20:0299,729846,496,968688,814,000128,965,0002,371,584
2Mar 24, 2026 20:02118,299994,225,221841,180,000128,874,0002,285,568
3Mar 24, 2026 20:02119,9061,006,583,927859,326,000123,902,0002,277,376