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 listSep 24, 2026 03:25wnwnScore: 3,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:253,38836,836,09326,996,0001,132,0002,113,536
2Sep 24, 2026 03:253,41337,114,97727,315,0001,020,0002,113,536
3Sep 24, 2026 03:253,47537,622,33227,708,0001,135,0002,113,536
4Sep 24, 2026 03:253,48737,693,25927,584,0001,360,0002,113,536
5Sep 24, 2026 03:253,50938,488,74828,043,0001,083,00020,480
6Sep 24, 2026 03:253,51038,555,07928,043,0001,092,00020,480
7Sep 24, 2026 03:253,53738,127,59928,207,0001,152,0002,113,536
8Sep 24, 2026 03:253,56738,362,07827,990,0001,622,00020,480
9Sep 24, 2026 03:253,60339,360,75328,651,0001,261,00020,480