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 15, 2026 02:17zielajzielajScore: 4,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 02:172,83544,061,84322,238,0001,010,0002,453,504
2Apr 15, 2026 02:174,34761,793,85834,630,0001,018,0002,367,488
3Apr 15, 2026 02:175,34670,178,30541,844,0001,992,0002,347,008