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 listSep 19, 2026 15:36Andrew EpsteinAndrew EpsteinScore: 19,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 15:372,75332,009,23221,463,0001,115,00024,576stderr
2Sep 19, 2026 15:372,75331,424,07121,457,0001,119,00024,576stderr
3Sep 19, 2026 15:372,76232,083,55721,560,0001,090,00024,576stderr
4Sep 19, 2026 15:372,76532,181,28421,654,0001,022,00024,576stderr
5Sep 19, 2026 15:3719,982173,324,282162,739,0001,117,00024,576stderr
6Sep 19, 2026 15:3720,026183,324,991163,075,0001,143,00024,576stderr
7Sep 19, 2026 15:3720,050174,600,993163,331,0001,087,00024,576stderr
8Sep 19, 2026 15:3720,433176,947,547166,533,0001,022,00024,576stderr
9Sep 19, 2026 15:3720,558177,404,286167,501,0001,076,00024,576stderr