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 4, 2026 07:02olliecrowolliecrowScore: 12,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 07:0212,655130,213,163101,778,0001,995,0002,453,504
2Mar 4, 2026 07:0212,744133,393,560103,498,0001,004,0002,412,544
3Mar 4, 2026 07:0212,790133,176,237102,885,0001,997,0002,334,720