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 20, 2026 05:53M-RochatM-RochatScore: 14,172Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:5314,103126,522,162114,729,0002,330,0002,113,536
2May 20, 2026 05:5314,111127,812,819114,784,0002,342,0002,113,536
3May 20, 2026 05:5314,125127,394,804114,902,0002,339,0002,113,536
4May 20, 2026 05:5314,132128,818,217115,244,0002,056,0002,113,536
5May 20, 2026 05:5314,172129,440,486115,291,0002,339,0002,113,536
6May 20, 2026 05:5314,178129,992,142115,621,0002,064,0002,113,536
7May 20, 2026 05:5314,199127,509,380115,799,0002,057,0002,113,536
8May 20, 2026 05:5314,232128,937,297116,085,0002,047,0002,113,536
9May 20, 2026 05:5314,265127,895,385116,354,0002,053,0002,113,536