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 listApr 15, 2026 02:22zielajzielajScore: 2,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 02:222,84850,623,34722,340,0001,015,0002,424,832
2Apr 15, 2026 02:222,86652,588,26422,483,0001,021,0002,396,160
3Apr 15, 2026 02:225,36175,328,48841,966,0001,998,0002,338,816