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 00:01marko1597marko1597Score: 379,817Success
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 00:30378,8083,116,371,1113,104,131,0002,096,0002,117,632stderr
2Aug 16, 2026 00:30379,1103,118,789,7613,107,545,0001,164,0002,117,632stderr
3Aug 16, 2026 00:30379,6193,122,887,2163,111,867,0001,015,0002,117,632stderr
4Aug 16, 2026 00:30379,7603,124,109,5983,112,937,0001,097,0002,117,632stderr
5Aug 16, 2026 00:30379,8173,124,459,0313,113,393,0001,112,0002,117,632stderr
6Aug 16, 2026 00:30380,0513,126,457,2763,115,334,0001,092,0002,117,632stderr
7Aug 16, 2026 00:30380,7513,132,047,7923,121,060,0001,100,0002,117,632stderr
8Aug 16, 2026 00:30381,1023,134,975,8973,123,996,0001,044,0002,117,632stderr
9Aug 16, 2026 00:30382,6693,147,840,3793,136,866,0001,023,0002,117,632stderr