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 21, 2026 04:26Yuriy LyfenkoYuriy LyfenkoScore: 4,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 04:264,337561,382,02833,535,0002,032,0002,400,256
2Mar 21, 2026 04:264,338562,768,87133,543,0002,032,0002,514,944
3Mar 21, 2026 04:264,360564,438,96833,762,0001,986,0002,289,664