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 18, 2026 18:43M-RochatM-RochatScore: 59,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 18:4459,32131,568,76120,871,0001,078,0002,113,536
2May 18, 2026 18:4459,43732,050,06720,907,0001,085,0002,113,536
3May 18, 2026 18:4459,46733,149,52120,925,0001,078,0002,113,536
4May 18, 2026 18:4459,55432,987,01020,851,0001,184,0002,113,536
5May 18, 2026 18:4459,61033,393,89021,037,0001,019,0002,113,536
6May 18, 2026 18:4459,63534,256,70320,986,0001,079,0002,113,536
7May 18, 2026 18:4459,74033,043,15120,949,0001,155,0002,113,536
8May 18, 2026 18:4459,75133,113,64220,940,0001,168,0002,113,536
9May 18, 2026 18:4459,80033,079,75820,987,0001,139,0002,113,536