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 05:04olliecrowolliecrowScore: 12,220Success
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 05:0412,215129,890,18399,163,0001,001,0002,461,696
2Mar 4, 2026 05:0412,220122,505,06798,203,0002,004,0002,408,448
3Mar 4, 2026 05:0412,241123,757,20498,370,0002,007,0002,416,640