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 16:39olliecrowolliecrowScore: 62,897Success
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 16:4062,61039,191,12320,145,0003,021,0002,506,752stderr
2Apr 21, 2026 16:4062,64341,866,56320,155,0003,023,0002,510,848stderr
3Apr 21, 2026 16:4062,72941,411,40621,192,0002,018,0002,498,560stderr
4Apr 21, 2026 16:4062,84036,802,80522,241,0001,010,0002,322,432stderr
5Apr 21, 2026 16:4062,89747,671,02120,237,0003,035,0002,498,560stderr
6Apr 21, 2026 16:4062,89739,295,50320,237,0003,035,0002,338,816stderr
7Apr 21, 2026 16:4062,92942,586,65420,247,0003,037,0002,506,752stderr
8Apr 21, 2026 16:4063,01644,695,66620,275,0003,041,0002,514,944stderr
9Apr 21, 2026 16:4063,12743,251,55921,326,0002,031,0002,506,752stderr