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 listJun 30, 2026 22:29IlyaIlyaScore: 61,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:3061,51032,292,94221,663,0001,096,0002,113,536
2Jun 30, 2026 22:3061,75432,360,21121,740,0001,109,0002,113,536
3Jun 30, 2026 22:3061,81832,331,47121,774,0001,099,0002,113,536
4Jun 30, 2026 22:3061,85133,643,96321,751,0001,134,0002,113,536
5Jun 30, 2026 22:3061,87532,453,93821,796,0001,098,0002,113,536
6Jun 30, 2026 22:3061,97832,358,54521,816,0001,116,0002,113,536
7Jun 30, 2026 22:3061,99432,845,54721,734,0001,204,0002,113,536
8Jun 30, 2026 22:3062,04332,346,63421,834,0001,122,0002,113,536
9Jun 30, 2026 22:3062,07532,420,85621,837,0001,131,0002,113,536