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 listOct 9, 2026 21:33janwwwjanwwwScore: 3,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:353,17236,648,85323,826,0002,190,0002,113,536
2Oct 9, 2026 21:353,17536,559,10423,829,0002,209,0002,113,536
3Oct 9, 2026 21:353,17736,603,55723,829,0002,228,0002,113,536
4Oct 9, 2026 21:353,18036,686,74023,812,0002,272,0002,113,536
5Oct 9, 2026 21:353,19137,398,62523,905,0002,265,0002,113,536
6Oct 9, 2026 21:353,20937,530,45224,025,0002,292,0002,113,536
7Oct 9, 2026 21:353,23748,044,04424,452,0002,093,0002,113,536
8Oct 9, 2026 21:353,25449,566,35224,558,0002,128,0002,117,632
9Oct 9, 2026 21:3530,267258,783,953246,018,0002,172,0002,113,536