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 28, 2026 16:09Dominique GarmierDominique GarmierScore: 20,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 16:0920,713196,139,322166,848,0002,997,0002,535,424
2Mar 28, 2026 16:0920,768194,803,277169,299,0001,001,0002,318,336
3Mar 28, 2026 16:0920,868194,390,044166,114,0005,003,0002,314,240