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 14, 2026 20:34marko1597marko1597Score: 3,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:463,49737,721,08727,473,0001,209,0002,121,728stderr
2Aug 14, 2026 20:463,51637,856,77027,624,0001,210,0002,121,728stderr
3Aug 14, 2026 20:463,53238,104,83027,927,0001,036,0002,121,728stderr
4Aug 14, 2026 20:463,53937,481,03927,982,0001,039,0002,121,728stderr
5Aug 14, 2026 20:463,55838,297,19028,139,0001,043,0002,121,728stderr
6Aug 14, 2026 20:463,56337,664,34228,177,0001,046,0002,121,728stderr
7Aug 14, 2026 20:463,56837,730,28428,222,0001,042,0002,121,728stderr
8Aug 14, 2026 20:463,57138,373,57928,241,0001,046,0002,121,728stderr
9Aug 14, 2026 20:463,58037,803,21628,311,0001,048,0002,121,728stderr