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 04:47wnwnScore: 3,478Success
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 04:483,31136,260,98526,442,0001,042,0002,113,536
2Sep 24, 2026 04:483,33836,407,21126,670,0001,042,0002,113,536
3Sep 24, 2026 04:483,44537,281,55027,546,0001,048,0002,113,536
4Sep 24, 2026 04:483,46537,552,30327,761,0001,002,0002,113,536
5Sep 24, 2026 04:483,47837,702,98027,865,0001,005,0002,113,536
6Sep 24, 2026 04:483,48239,730,17027,893,0001,013,0002,113,536
7Sep 24, 2026 04:483,48838,461,48727,921,0001,031,0002,113,536
8Sep 24, 2026 04:483,49538,492,29428,010,0001,001,0002,113,536
9Sep 24, 2026 04:483,49638,456,61627,961,0001,064,0002,113,536