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 listMar 3, 2026 22:38olliecrowolliecrowScore: 70,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 22:3870,32458,466,38425,020,0001,000,0002,277,376
2Mar 3, 2026 22:3870,43852,502,37324,058,0002,004,0002,387,968
3Mar 3, 2026 22:3870,57347,229,86024,104,0002,008,0002,400,256
4Mar 3, 2026 22:3870,61450,696,99925,123,0001,004,0002,404,352
5Mar 3, 2026 22:3870,90848,714,91424,218,0002,018,0002,392,064
6Mar 3, 2026 22:3870,94949,905,53225,242,0001,009,0002,277,376
7Mar 3, 2026 22:3871,13051,029,92426,318,00002,277,376
8Mar 3, 2026 22:3871,39247,321,91926,415,00002,400,256
9Mar 3, 2026 22:3871,57348,762,10725,464,0001,018,0002,277,376