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:58marko1597marko1597Score: 158,957Success
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 13:10156,3751,292,286,4721,280,096,0002,184,0002,117,632stderr
2Aug 16, 2026 13:10157,0011,297,312,1441,285,233,0002,183,0002,117,632stderr
3Aug 16, 2026 13:10157,0341,297,629,6391,285,593,0002,090,0002,117,632stderr
4Aug 16, 2026 13:10157,4271,302,178,4821,288,699,0002,205,0002,117,632stderr
5Aug 16, 2026 13:10158,9571,313,292,1411,301,414,0002,041,0002,117,632stderr
6Aug 16, 2026 13:10159,8891,321,018,8101,308,882,0002,211,0002,117,632stderr
7Aug 16, 2026 13:10160,1051,322,889,0551,310,706,0002,163,0002,117,632stderr
8Aug 16, 2026 13:10161,1261,331,205,5731,319,124,0002,111,0002,117,632stderr
9Aug 16, 2026 13:10163,6171,351,547,9051,338,449,0003,211,0002,117,632stderr