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:26Josu San MartinJosu San MartinScore: 3,335Success
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:273,30637,975,33626,030,0001,084,0002,113,536
2Sep 3, 2026 16:273,31337,226,29926,112,0001,055,0002,113,536
3Sep 3, 2026 16:273,31937,200,72526,181,0001,041,0002,113,536
4Sep 3, 2026 16:273,32538,150,96426,200,0001,068,0002,113,536
5Sep 3, 2026 16:273,33538,211,88926,259,0001,088,0002,113,536
6Sep 3, 2026 16:273,34938,320,68826,405,0001,063,0002,113,536
7Sep 3, 2026 16:2715,668138,483,010127,450,0001,033,0002,113,536
8Sep 3, 2026 16:2715,671139,274,838127,440,0001,064,0002,113,536
9Sep 3, 2026 16:2715,673138,642,574127,449,0001,071,0002,113,536