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 23, 2026 21:44olliecrowolliecrowScore: 33,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 21:4714,465127,080,402115,630,0002,990,0002,420,736
2Apr 23, 2026 21:4714,467137,955,873115,646,0002,990,0002,584,576
3Apr 23, 2026 21:4714,469126,980,256116,654,0001,994,0002,519,040
4Apr 23, 2026 21:4714,476126,810,888116,698,0002,012,0002,420,736
5Apr 23, 2026 21:4733,171289,663,400269,004,0003,000,0002,375,680
6Apr 23, 2026 21:4733,240280,845,905269,578,0002,995,0002,445,312
7Apr 23, 2026 21:4733,315281,518,952270,181,0003,002,0002,392,064
8Apr 23, 2026 21:4733,333280,842,500266,330,0007,008,0002,334,720
9Apr 23, 2026 21:4733,400281,688,790266,887,0006,997,0002,478,080