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 listApr 25, 2026 22:45olliecrowolliecrowScore: 3,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 22:453,48648,049,49425,525,0003,063,0002,330,624
2Apr 25, 2026 22:453,49249,620,54125,568,0003,068,0002,351,104
3Apr 25, 2026 22:453,49651,336,78226,625,0002,048,0002,527,232
4Apr 25, 2026 22:453,51751,151,41125,861,0002,984,0002,547,712
5Apr 25, 2026 22:453,52445,349,50324,916,0003,986,0002,424,832
6Apr 25, 2026 22:453,52950,029,11026,947,0001,996,0002,465,792
7Apr 25, 2026 22:4523,525211,689,138186,914,0005,997,0002,490,368
8Apr 25, 2026 22:4523,570211,025,442190,274,0003,004,0002,363,392
9Apr 25, 2026 22:4523,749211,144,372190,750,0003,994,0002,392,064