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 19, 2026 16:45Victor MerckléVictor MerckléScore: 8,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 16:458,04976,281,61265,684,0001,127,0002,113,536
2May 19, 2026 16:458,08975,074,36666,046,0001,095,0002,113,536
3May 19, 2026 16:458,10375,710,76966,164,0001,097,0002,113,536
4May 19, 2026 16:458,23877,194,84167,262,0001,118,0002,113,536
5May 19, 2026 16:458,24676,849,05367,343,0001,102,0002,113,536
6May 19, 2026 16:458,25678,747,71167,429,0001,099,0002,113,536
7May 19, 2026 16:458,29079,059,38867,714,0001,099,0002,113,536
8May 19, 2026 16:458,29178,869,77767,730,0001,092,0002,113,536
9May 19, 2026 16:458,30877,435,93367,846,0001,112,0002,113,536