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 11, 2026 12:09Victor MerckléVictor MerckléScore: 61,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 12:0960,876516,854,690501,655,0003,620,0002,121,728stderr
2May 11, 2026 12:0961,034517,005,367503,001,0003,582,0002,121,728stderr
3May 11, 2026 12:0961,044517,664,104503,129,0003,539,0002,121,728stderr
4May 11, 2026 12:0961,060516,503,365503,254,0003,544,0002,121,728stderr
5May 11, 2026 12:0961,063517,468,303503,305,0003,523,0002,121,728stderr
6May 11, 2026 12:0961,112515,859,612503,710,0003,525,0002,121,728stderr
7May 11, 2026 12:0961,173517,025,272504,146,0003,595,0002,121,728stderr
8May 11, 2026 12:0961,231517,489,198504,764,0003,461,0002,121,728stderr
9May 11, 2026 12:0961,283517,352,849505,079,0003,577,0002,121,728stderr