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 28, 2026 18:06Dominique GarmierDominique GarmierScore: 14,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 18:0614,637149,113,826116,022,0004,000,0002,531,328
2Mar 28, 2026 18:0614,651144,026,255118,123,0002,019,0002,531,328
3Mar 28, 2026 18:0614,704147,130,112118,564,0002,009,0002,531,328