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 12, 2026 03:17Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 03:18040,887,36032,504,0001,084,0002,113,536expected "53682061652410079 ", got "53682279653307541 "
2May 12, 2026 03:18041,892,11832,777,0001,053,0002,113,536expected "53690618444125579 ", got "53690618352621474 "
3May 12, 2026 03:184,03440,851,42532,425,0001,062,0002,113,536
4May 12, 2026 03:184,04341,887,25432,475,0001,088,0002,113,536
5May 12, 2026 03:184,04442,888,67032,472,0001,097,0002,113,536
6May 12, 2026 03:184,04542,592,06832,497,0001,082,0002,113,536
7May 12, 2026 03:184,05643,432,10332,590,0001,078,0002,113,536
8May 12, 2026 03:184,09753,090,98332,915,0001,098,0002,113,536
9May 12, 2026 03:184,16843,490,65933,502,0001,099,0002,113,536