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 10, 2026 11:24wnwnScore: 3,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:253,39043,141,05527,042,0001,098,0002,473,984
2May 10, 2026 11:253,39444,480,40927,111,0001,066,0002,490,368
3May 10, 2026 11:253,41746,554,65527,290,0001,075,0002,486,272
4May 10, 2026 11:253,43741,652,45027,447,0001,085,0002,494,464
5May 10, 2026 11:253,53843,453,11528,309,0001,062,0002,486,272
6May 10, 2026 11:253,54342,752,44928,316,0001,091,0002,478,080
7May 10, 2026 11:253,56145,959,39428,480,0001,080,0002,486,272
8May 10, 2026 11:253,57744,652,02828,603,0001,088,0002,482,176
9May 10, 2026 11:253,59844,609,48228,763,0001,108,0002,473,984