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 4, 2026 12:15limanjun99limanjun99Score: 4,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 12:154,36653,508,93332,933,0003,307,0002,506,752
2May 4, 2026 12:154,38054,623,16433,098,0003,260,0002,498,560
3May 4, 2026 12:154,38555,034,64434,133,0002,266,0002,494,464
4May 4, 2026 12:154,40855,368,64534,324,0002,267,0002,494,464
5May 4, 2026 12:154,41151,274,86733,236,0003,376,0002,506,752
6May 4, 2026 12:154,43450,830,90833,491,0003,314,0002,502,656
7May 4, 2026 12:154,44553,416,66233,544,0003,352,0002,514,944
8May 4, 2026 12:154,44751,699,09233,579,0003,334,0002,498,560
9May 4, 2026 12:154,48355,343,15133,670,0003,539,0002,502,656