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 21, 2026 11:35Dominique GarmierDominique GarmierScore: 17,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 11:3517,281169,844,893139,713,0001,995,0002,461,696
2Mar 21, 2026 11:3517,415167,757,942138,809,0003,994,0002,400,256
3Mar 21, 2026 11:3518,039179,113,136140,924,0006,996,0002,519,040