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 6, 2026 07:17flavio87flavio87Score: 15,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 07:1715,527148,236,842126,817,0002,059,0002,416,640
2May 6, 2026 07:1715,538146,960,405126,765,0002,203,0002,404,352
3May 6, 2026 07:1715,547143,594,567126,894,0002,148,0002,441,216
4May 6, 2026 07:1715,571144,556,301127,131,0002,109,0002,404,352
5May 6, 2026 07:1715,587146,774,353127,297,0002,083,0002,416,640
6May 6, 2026 07:1715,589146,945,943127,341,0002,055,0002,408,448
7May 6, 2026 07:1715,623147,920,035127,614,0002,065,0002,428,928
8May 6, 2026 07:1715,646149,534,059127,775,0002,087,0002,404,352
9May 6, 2026 07:1715,853150,339,215128,558,0003,030,0002,392,064