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 29, 2026 16:06Charles CabergsCharles CabergsScore: 4,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 16:074,70155,899,41036,526,0002,029,0002,375,680
2Apr 29, 2026 16:074,70753,641,91935,553,0003,047,0002,322,432
3Apr 29, 2026 16:074,70758,680,73537,583,0001,015,0002,379,776
4Apr 29, 2026 16:074,72457,897,75037,723,0001,019,0002,359,296
5Apr 29, 2026 16:074,73556,807,14835,843,0002,986,0002,375,680
6Apr 29, 2026 16:074,75953,522,65936,024,0003,002,0002,334,720
7Apr 29, 2026 16:079,67594,748,79777,335,0002,008,0002,453,504
8Apr 29, 2026 16:079,68295,457,43475,377,0004,020,0002,473,984
9Apr 29, 2026 16:079,741103,850,04175,890,0003,994,0002,396,160