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 25, 2026 05:06limanjun99limanjun99Score: 43,067Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 05:0739,784343,993,621321,227,0005,003,0002,379,776
2Apr 25, 2026 05:0743,067369,530,264345,149,0008,003,0002,445,312
3Apr 25, 2026 05:0743,398376,513,216348,871,0006,997,0002,519,040