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 listMay 1, 2026 16:54Pavel SkripkinPavel SkripkinScore: 12,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 16:5412,232116,607,20399,302,0001,003,0002,465,792
2May 1, 2026 16:5412,234111,950,86998,320,0002,006,0002,314,240
3May 1, 2026 16:5412,244117,057,24199,401,0001,004,0002,404,352
4May 1, 2026 16:5412,252117,219,05698,460,0002,009,0002,392,064
5May 1, 2026 16:5412,257118,872,18598,503,0002,010,0002,396,160
6May 1, 2026 16:5412,265119,106,41599,574,0001,005,0002,322,432
7May 1, 2026 16:5412,271115,862,38398,617,0002,012,0002,404,352
8May 1, 2026 16:5412,278114,704,52698,689,0001,993,0002,400,256
9May 1, 2026 16:5412,310118,636,25698,945,0001,998,0002,392,064