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 24, 2026 22:51olliecrowolliecrowScore: 3,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 22:523,29045,651,22924,981,0001,998,0002,334,720stderr
2Apr 24, 2026 22:523,29742,141,13723,033,0004,005,0002,551,808stderr
3Apr 24, 2026 22:523,30745,842,53825,112,0002,008,0002,519,040stderr
4Apr 24, 2026 22:523,33148,537,88226,304,0001,011,0002,449,408stderr
5Apr 24, 2026 22:523,33946,713,24226,328,0001,053,0002,514,944stderr
6Apr 24, 2026 22:523,34141,559,79626,388,0001,014,0002,457,600stderr
7Apr 24, 2026 22:5223,735213,055,564191,641,0002,994,0002,564,096stderr
8Apr 24, 2026 22:5223,783210,036,780192,023,0003,000,0002,482,176stderr
9Apr 24, 2026 22:5223,972214,770,210193,585,0002,993,0002,314,240stderr