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 18:52Dominique GarmierDominique GarmierScore: 19,839Success
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 18:5219,653182,570,095158,149,0003,002,0002,461,696
2Mar 24, 2026 18:5219,839184,447,754160,686,0001,996,0002,433,024
3Mar 24, 2026 18:5220,339195,283,947164,768,0002,009,0002,351,104