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 16, 2026 05:10Victor MerckléVictor MerckléScore: 6,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 05:116,95065,211,42056,674,0001,011,0002,113,536
2May 16, 2026 05:116,95166,105,81556,685,0001,014,0002,113,536
3May 16, 2026 05:116,95366,015,83757,712,00002,113,536
4May 16, 2026 05:116,95464,978,33556,721,0001,002,0002,113,536
5May 16, 2026 05:116,95466,996,76956,693,0001,027,0002,113,536
6May 16, 2026 05:116,96367,974,34156,742,0001,051,0002,113,536
7May 16, 2026 05:116,97465,215,50956,863,0001,025,0002,113,536
8May 16, 2026 05:116,98167,347,76156,944,0001,003,0002,113,536
9May 16, 2026 05:117,01066,900,65957,147,0001,042,0002,113,536