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 23:31olliecrowolliecrowScore: 12,203Success
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 23:3112,169124,670,55398,791,000997,0002,428,928
2Mar 4, 2026 23:3112,203125,796,55399,065,0001,000,0002,449,408
3Mar 4, 2026 23:3112,287125,057,50499,758,000997,0002,461,696