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 10:35marko1597marko1597Score: 2,854Success
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 10:402,79931,221,78521,931,0001,021,0002,117,632stderr
2Aug 16, 2026 10:402,80931,335,47221,920,0001,115,0002,117,632stderr
3Aug 16, 2026 10:402,82432,120,90522,045,0001,113,0002,117,632stderr
4Aug 16, 2026 10:402,83331,575,05322,199,0001,038,0002,117,632stderr
5Aug 16, 2026 10:402,85440,076,12022,225,0001,179,0002,117,632stderr
6Aug 16, 2026 10:407,34471,349,70359,061,0001,164,0002,117,632stderr
7Aug 16, 2026 10:407,36668,707,68159,361,0001,041,0002,117,632stderr
8Aug 16, 2026 10:407,49069,717,12660,256,0001,163,0002,117,632stderr
9Aug 16, 2026 10:407,50170,476,76160,335,0001,177,0002,117,632stderr