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:45marko1597marko1597Score: 7,203Success
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:492,70130,371,36920,988,0001,165,0002,117,632stderr
2Aug 16, 2026 12:492,70930,457,34221,015,0001,204,0002,117,632stderr
3Aug 16, 2026 12:496,95165,297,08555,846,0001,153,0002,117,632stderr
4Aug 16, 2026 12:497,13866,803,96457,384,0001,151,0002,117,632stderr
5Aug 16, 2026 12:497,20368,012,78158,036,0001,034,0002,117,632stderr
6Aug 16, 2026 12:497,20767,401,60658,048,0001,051,0002,117,632stderr
7Aug 16, 2026 12:497,26567,911,71458,409,0001,169,0002,117,632stderr
8Aug 16, 2026 12:497,29668,907,95958,797,0001,038,0002,117,632stderr
9Aug 16, 2026 12:497,34968,561,71159,113,0001,154,0002,117,632stderr