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 listSep 3, 2026 05:02Josu San MartinJosu San MartinScore: 11,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 05:033,58140,039,35428,321,0001,045,0002,113,536
2Sep 3, 2026 05:033,58339,346,23828,350,0001,032,0002,113,536
3Sep 3, 2026 05:0310,27994,422,91979,203,0005,091,0002,113,536
4Sep 3, 2026 05:0310,75898,921,54282,905,0005,314,0002,113,536
5Sep 3, 2026 05:0311,092101,744,57085,164,0005,793,0002,113,536
6Sep 3, 2026 05:0311,499104,373,58988,131,0006,164,0002,113,536
7Sep 3, 2026 05:0317,699155,608,941138,925,0006,207,0002,117,632
8Sep 3, 2026 05:0317,928157,868,604140,805,0006,208,0002,117,632
9Sep 3, 2026 05:0321,043182,625,963166,167,0006,393,0002,117,632