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 3, 2026 14:32TudyMTudyMScore: 23,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 14:4122,795202,187,776182,658,0004,266,0002,449,408
2May 3, 2026 14:4122,842203,316,705183,232,0004,075,0002,445,312
3May 3, 2026 14:4122,863202,449,606183,239,0004,244,0002,367,488
4May 3, 2026 14:4123,042205,996,407184,794,0004,155,0002,412,544
5May 3, 2026 14:4123,049207,159,431184,757,0004,251,0002,404,352
6May 3, 2026 14:4123,085205,569,319184,926,0004,377,0002,551,808
7May 3, 2026 14:4123,150205,794,891185,485,0004,353,0002,453,504
8May 3, 2026 14:4123,179210,112,244185,731,0004,337,0002,449,408
9May 3, 2026 14:4123,491207,785,487188,595,0004,032,0002,465,792