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 listAug 16, 2026 12:52marko1597marko1597Score: 7,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 12:562,69630,399,90821,083,0001,028,0002,117,632stderr
2Aug 16, 2026 12:562,71032,203,04821,193,0001,035,0002,117,632stderr
3Aug 16, 2026 12:562,72230,601,67321,202,0001,121,0002,117,632stderr
4Aug 16, 2026 12:562,79831,902,97521,780,0001,167,0002,117,632stderr
5Aug 16, 2026 12:567,15068,131,36357,464,0001,168,0002,117,632stderr
6Aug 16, 2026 12:567,27167,860,93158,465,0001,161,0002,117,632stderr
7Aug 16, 2026 12:567,31268,351,73758,822,0001,144,0002,117,632stderr
8Aug 16, 2026 12:567,34868,471,14559,110,0001,149,0002,117,632stderr
9Aug 16, 2026 12:567,51869,936,52160,483,0001,166,0002,117,632stderr