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 5, 2026 13:17wnwnScore: 3,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:173,49237,388,79827,958,0001,029,0002,113,536
2Sep 5, 2026 13:173,49737,382,92228,023,0001,003,0002,113,536
3Sep 5, 2026 13:173,51137,577,69128,140,0001,002,0002,113,536
4Sep 5, 2026 13:173,51437,610,95428,164,0001,005,0002,113,536
5Sep 5, 2026 13:173,57438,220,29428,660,0001,010,0002,113,536
6Sep 5, 2026 13:173,59638,202,77328,841,0001,014,0002,113,536
7Sep 5, 2026 13:173,60938,374,00328,938,0001,019,0002,113,536
8Sep 5, 2026 13:173,61139,178,49728,967,0001,009,0002,113,536
9Sep 5, 2026 13:173,62538,526,32129,060,0001,028,0002,113,536