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 listApr 21, 2026 09:34Dominique GarmierDominique GarmierScore: 71,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 09:3570,75447,522,75924,166,0002,013,0002,494,464
2Apr 21, 2026 09:3570,91849,629,73024,222,0002,018,0002,494,464
3Apr 21, 2026 09:3571,00049,717,24524,250,0002,020,0002,273,280
4Apr 21, 2026 09:3571,05449,597,36025,279,0001,011,0002,510,848
5Apr 21, 2026 09:3571,26459,018,02125,354,0001,014,0002,502,656
6Apr 21, 2026 09:3571,31650,686,49925,373,0001,014,0002,502,656
7Apr 21, 2026 09:3571,50849,728,67925,441,0001,017,0002,506,752
8Apr 21, 2026 09:3571,93552,577,62626,616,00002,273,280
9Apr 21, 2026 09:3572,05656,546,74725,636,0001,025,0002,494,464