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 27, 2026 12:39Dominique GarmierDominique GarmierScore: 11,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 12:3910,985110,558,53385,076,0005,004,0002,400,256
2Mar 27, 2026 12:3911,007115,145,74489,253,0001,002,0002,408,448
3Mar 27, 2026 12:3911,070110,298,95987,786,0002,992,0002,416,640