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 28, 2026 13:07Dominique GarmierDominique GarmierScore: 70,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 13:0870,42443,415,18024,053,0002,004,0002,379,776
2Apr 28, 2026 13:0870,56743,157,11924,102,0002,008,0002,383,872
3Apr 28, 2026 13:0870,59440,737,22824,111,0002,009,0002,334,720
4Apr 28, 2026 13:0870,77840,868,51025,181,0001,007,0002,379,776
5Apr 28, 2026 13:0870,79145,502,66524,179,0002,014,0002,379,776
6Apr 28, 2026 13:0870,99145,110,52424,247,0002,020,0002,392,064
7Apr 28, 2026 13:0871,04343,822,46725,275,0001,011,0002,379,776
8Apr 28, 2026 13:0871,06743,407,78425,284,0001,011,0002,375,680
9Apr 28, 2026 13:0871,48345,704,98725,432,0001,017,0002,375,680