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 23, 2026 21:44izotoffizotoffScore: 24,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 21:4424,605226,020,354199,762,0001,997,0002,519,040
2Mar 23, 2026 21:4424,823232,154,322202,548,0001,002,0002,322,432
3Mar 23, 2026 21:4425,241234,953,778202,979,0003,999,0002,527,232