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 19:42Josu San MartinJosu San MartinScore: 3,313Success
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 19:433,28437,120,44825,642,0001,292,0002,117,632
2Sep 3, 2026 19:433,29037,032,82225,960,0001,026,0002,117,632
3Sep 3, 2026 19:433,29037,046,06125,957,0001,024,0002,117,632
4Sep 3, 2026 19:433,29336,957,24125,801,0001,207,0002,117,632
5Sep 3, 2026 19:433,31337,849,30726,143,0001,024,0002,117,632
6Sep 3, 2026 19:4316,122142,279,519131,200,0001,007,0002,117,632
7Sep 3, 2026 19:4316,221144,233,531132,004,0001,011,0002,117,632
8Sep 3, 2026 19:4316,236143,076,545132,040,0001,096,0002,117,632
9Sep 3, 2026 19:4316,274144,251,243132,440,0001,007,0002,117,632