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:18marko1597marko1597Score: 3,587Success
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:333,55437,336,76027,953,0001,193,0002,121,728stderr
2Aug 14, 2026 20:333,55537,462,83927,974,0001,184,0002,121,728stderr
3Aug 14, 2026 20:333,57937,561,71128,195,0001,153,0002,121,728stderr
4Aug 14, 2026 20:333,58137,574,28628,325,0001,046,0002,121,728stderr
5Aug 14, 2026 20:333,58737,604,23528,370,0001,046,0002,121,728stderr
6Aug 14, 2026 20:333,59537,694,55028,439,0001,041,0002,121,728stderr
7Aug 14, 2026 20:333,61937,844,00628,636,0001,045,0002,121,728stderr
8Aug 14, 2026 20:333,62838,001,27228,703,0001,049,0002,121,728stderr
9Aug 14, 2026 20:338,48179,334,80468,535,0001,017,0002,121,728stderr