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 listNov 10, 2025 02:20izotoffizotoffScore: 132,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 02:20116,937988,208,443790,083,000168,804,0002,363,392
2Nov 10, 2025 02:20132,7601,118,915,630919,842,000168,787,0002,334,720
3Nov 10, 2025 02:20133,4261,117,549,420924,237,000169,859,0002,334,720