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 24, 2026 07:08Dominique GarmierDominique GarmierScore: 10,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 07:0810,357112,010,16881,934,0002,997,0002,326,528
2Mar 24, 2026 07:0810,373116,272,25083,060,0002,001,0002,363,392
3Mar 24, 2026 07:0810,377111,569,84984,092,0001,001,0002,383,872