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 7, 2026 16:15flavio87flavio87Score: 13,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 16:1513,506128,218,093109,989,0002,114,0002,396,160
2May 7, 2026 16:1513,534127,952,589110,151,0002,185,0002,400,256
3May 7, 2026 16:1513,536129,380,112110,239,0002,117,0002,420,736
4May 7, 2026 16:1513,539126,783,898110,248,0002,132,0002,392,064
5May 7, 2026 16:1513,549129,177,840110,300,0002,161,0002,375,680
6May 7, 2026 16:1513,552128,147,606110,473,0002,015,0002,428,928
7May 7, 2026 16:1513,562130,115,930110,435,0002,132,0002,392,064
8May 7, 2026 16:1513,565129,941,717110,464,0002,127,0002,445,312
9May 7, 2026 16:1513,576128,858,526110,668,0002,021,0002,338,816