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 25, 2026 11:47Dominique GarmierDominique GarmierScore: 12,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 11:4712,233127,948,782100,314,00002,437,120
2Mar 25, 2026 11:4712,446127,974,430100,060,0002,001,0002,269,184
3Mar 25, 2026 11:4712,813130,970,621104,067,0001,000,0002,285,568