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 20:39Josu San MartinJosu San MartinScore: 3,346Success
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 20:403,29937,194,01225,963,0001,092,0002,113,536
2Sep 3, 2026 20:403,30737,185,73926,040,0001,084,0002,113,536
3Sep 3, 2026 20:403,30837,185,84326,081,0001,050,0002,113,536
4Sep 3, 2026 20:403,32437,320,45026,214,0001,045,0002,113,536
5Sep 3, 2026 20:403,34638,256,39426,396,0001,044,0002,113,536
6Sep 3, 2026 20:403,35339,855,42426,398,0001,099,0002,113,536
7Sep 3, 2026 20:4015,608138,101,517126,917,0001,073,0002,113,536
8Sep 3, 2026 20:4015,672139,494,705127,438,0001,080,0002,113,536
9Sep 3, 2026 20:4015,705139,099,909127,738,0001,043,0002,113,536