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 03:46Josu San MartinJosu San MartinScore: 4,291Success
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 03:474,23144,762,22032,503,0002,193,0002,113,536
2Sep 3, 2026 03:474,26344,954,78032,575,0002,386,0002,113,536
3Sep 3, 2026 03:474,26545,020,75132,781,0002,194,0002,113,536
4Sep 3, 2026 03:474,28045,125,84732,750,0002,346,0002,113,536
5Sep 3, 2026 03:474,29145,237,99532,848,0002,343,0002,113,536
6Sep 3, 2026 03:474,30145,633,32432,870,0002,404,0002,113,536
7Sep 3, 2026 03:474,30445,275,53633,076,0002,222,0002,113,536
8Sep 3, 2026 03:474,31045,437,70833,020,0002,325,0002,113,536
9Sep 3, 2026 03:474,31446,230,62033,322,0002,057,0002,113,536