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 13, 2026 02:15Josu San MartinJosu San MartinScore: 4,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 02:153,39854,915,57424,881,0002,985,0002,449,408
2Mar 13, 2026 02:154,05663,420,14131,245,0002,015,0002,498,560
3Mar 13, 2026 02:1511,727120,239,34895,161,0001,001,0002,379,776