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 listMar 23, 2026 07:07Dominique GarmierDominique GarmierScore: 13,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 07:0713,539136,763,204109,016,0002,000,0002,441,216
2Mar 23, 2026 07:0713,675142,376,447110,131,0002,002,0002,404,352
3Mar 23, 2026 07:0713,692142,270,221111,276,0001,002,0002,334,720