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 16:47Dominique GarmierDominique GarmierScore: 10,309Success
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 16:4710,285116,241,22682,326,0002,007,0002,392,064
2Mar 24, 2026 16:4710,309116,198,76882,548,0001,989,0002,408,448
3Mar 24, 2026 16:4710,336112,638,70482,759,0001,994,0002,355,200