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 23:48Dominique GarmierDominique GarmierScore: 10,098Success
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 23:4810,095109,950,62880,784,0001,994,0002,445,312
2Mar 24, 2026 23:4810,098112,263,81479,813,0002,992,0002,334,720
3Mar 24, 2026 23:4810,130108,769,06878,062,0005,003,0002,351,104