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 22, 2026 12:17Dominique GarmierDominique GarmierScore: 10,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 12:1710,792117,272,90084,514,0003,977,0002,408,448
2Mar 22, 2026 12:1710,811120,321,23987,647,0001,007,0002,392,064
3Mar 22, 2026 12:1716,569171,912,737131,012,0004,852,0002,510,848