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 3, 2026 16:48Josu San MartinJosu San MartinScore: 3,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 16:483,34037,390,92526,314,0001,080,0002,113,536
2Sep 3, 2026 16:483,34738,390,29326,365,0001,088,0002,113,536
3Sep 3, 2026 16:483,35937,535,83626,468,0001,078,0002,113,536
4Sep 3, 2026 16:483,36537,609,57326,540,0001,056,0002,113,536
5Sep 3, 2026 16:483,36637,689,18526,531,0001,074,0002,113,536
6Sep 3, 2026 16:483,37638,047,94926,600,0001,089,0002,113,536
7Sep 3, 2026 16:4815,650139,378,648127,260,0001,076,0002,113,536
8Sep 3, 2026 16:4815,654138,428,012127,334,0001,034,0002,113,536
9Sep 3, 2026 16:4815,700138,855,281127,705,0001,043,0002,113,536