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 3, 2026 05:44limanjun99limanjun99Score: 5,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 05:455,32762,587,40540,200,0004,020,0002,506,752
2May 3, 2026 05:455,34461,977,43840,325,0004,032,0002,510,848
3May 3, 2026 05:455,34964,705,33540,367,0004,036,0002,514,944
4May 3, 2026 05:455,36261,327,71740,460,0004,046,0002,506,752
5May 3, 2026 05:455,37064,076,12840,527,0004,052,0002,379,776
6May 3, 2026 05:455,37563,326,37441,577,0003,042,0002,502,656
7May 3, 2026 05:455,37863,004,30240,586,0004,058,0002,510,848
8May 3, 2026 05:455,37963,679,52140,590,0004,059,0002,506,752
9May 3, 2026 05:455,49365,620,33443,574,0002,026,0002,506,752