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 listMay 16, 2026 08:04M-RochatM-RochatScore: 75,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:0575,55636,730,81026,672,0001,284,0002,113,536
2May 16, 2026 08:0575,75438,487,07827,000,0001,029,0002,113,536
3May 16, 2026 08:0575,78638,229,14826,765,0001,276,0002,113,536
4May 16, 2026 08:0575,80036,897,78926,997,0001,049,0002,113,536
5May 16, 2026 08:0575,97538,958,89627,064,0001,047,0002,113,536
6May 16, 2026 08:0576,01336,886,84426,851,0001,274,0002,113,536
7May 16, 2026 08:0576,30540,166,23627,169,0001,064,0002,113,536
8May 16, 2026 08:0576,30838,713,03427,208,0001,026,0002,113,536
9May 16, 2026 08:0576,41639,207,66227,242,0001,032,0002,113,536