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 21, 2026 11:30Victor MerckléVictor MerckléScore: 4,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 11:304,67646,603,02137,767,0001,046,0002,113,536
2May 21, 2026 11:304,67647,068,31537,744,0001,067,0002,113,536
3May 21, 2026 11:304,69549,331,54837,940,0001,030,0002,113,536
4May 21, 2026 11:304,69748,281,07137,931,0001,056,0002,113,536
5May 21, 2026 11:304,70846,915,25137,996,0001,085,0002,113,536
6May 21, 2026 11:304,71648,770,42638,047,0001,096,0002,113,536
7May 21, 2026 11:304,72147,016,82438,165,0001,024,0002,113,536
8May 21, 2026 11:304,81847,877,38338,930,0001,060,0002,113,536
9May 21, 2026 11:304,87651,307,72339,443,0001,028,0002,113,536