Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 17, 2026 03:32M-RochatM-RochatScore: 13,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 03:3313,694124,735,374111,469,0002,195,0002,113,536
2May 17, 2026 03:3313,712124,669,151111,675,0002,136,0002,113,536
3May 17, 2026 03:3313,713122,532,435111,644,0002,179,0002,113,536
4May 17, 2026 03:3313,714123,573,898111,667,0002,161,0002,113,536
5May 17, 2026 03:3313,773126,762,978112,137,0002,184,0002,113,536
6May 17, 2026 03:3313,795126,288,128111,341,0003,159,0002,113,536
7May 17, 2026 03:3313,820135,777,798111,517,0003,192,0002,113,536
8May 17, 2026 03:3313,843125,741,697111,655,0003,245,0002,113,536
9May 17, 2026 03:3313,865125,799,296111,897,0003,183,0002,113,536