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 listApr 27, 2026 10:04wnwnScore: 3,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:053,40347,332,19727,238,0001,008,0002,486,272
2Apr 27, 2026 10:053,47042,705,73826,817,0001,986,0002,490,368
3Apr 27, 2026 10:053,48943,519,97226,966,0001,997,0002,482,176
4Apr 27, 2026 10:053,53247,742,96728,312,0001,011,0002,478,080
5Apr 27, 2026 10:053,56650,471,03328,582,0001,020,0002,490,368
6Apr 27, 2026 10:053,56747,217,91428,592,0001,021,0002,482,176
7Apr 27, 2026 10:053,58948,322,86528,767,0001,027,0002,473,984
8Apr 27, 2026 10:053,61246,982,57627,988,0001,999,0002,486,272
9Apr 27, 2026 10:053,62047,100,07228,050,0002,003,0002,478,080