TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJul 26, 2026 15:48Misgana BayettaMisgana BayettaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2026 15:4901,180,981,500938,290,000226,433,0002,179,072expected "429496486442 ", got "0 "
2Jul 26, 2026 15:4901,173,446,481935,190,000218,543,0002,113,536expected "429496475741 ", got "0 "
3Jul 26, 2026 15:4901,185,772,379938,843,000230,292,0002,117,632expected "429496576633 ", got "0 "