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 20, 2026 23:50olliecrowolliecrowScore: 3,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 23:513,29756,635,32724,033,0003,004,0002,269,184
2Apr 20, 2026 23:513,29849,654,93325,042,0002,003,0002,330,624
3Apr 20, 2026 23:513,31553,640,71924,169,0003,021,0002,248,704
4Apr 20, 2026 23:513,32153,654,70025,217,0002,017,0002,260,992
5Apr 20, 2026 23:513,32449,640,78026,252,0001,009,0002,494,464
6Apr 20, 2026 23:5123,755222,544,614190,802,0003,995,0002,310,144
7Apr 20, 2026 23:5123,782217,494,777192,017,0003,000,0002,465,792
8Apr 20, 2026 23:5123,835212,565,669193,457,0001,994,0002,281,472
9Apr 20, 2026 23:5123,899221,630,761192,975,0002,999,0002,400,256