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 15, 2026 19:01Victor MerckléVictor MerckléScore: 79,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 19:0179,187665,777,336653,987,0003,266,0002,121,728stderr
2May 15, 2026 19:0179,225666,024,400654,065,0003,506,0002,121,728stderr
3May 15, 2026 19:0179,334665,661,295655,087,0003,390,0002,121,728stderr
4May 15, 2026 19:0179,449669,699,615655,892,0003,536,0002,121,728stderr
5May 15, 2026 19:0179,475668,933,970656,111,0003,532,0002,121,728stderr
6May 15, 2026 19:0179,862671,805,717659,604,0003,254,0002,121,728stderr
7May 15, 2026 19:0180,064673,671,786660,881,0003,654,0002,121,728stderr
8May 15, 2026 19:0180,094675,470,819660,344,0004,443,0002,121,728stderr
9May 15, 2026 19:0180,212673,681,820662,263,0003,499,0002,121,728stderr