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 7, 2026 10:28wnwnScore: 3,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:283,41941,864,34227,323,0001,055,0002,482,176
2May 7, 2026 10:283,42842,941,94827,402,0001,058,0002,482,176
3May 7, 2026 10:283,44344,714,82927,516,0001,066,0002,486,272
4May 7, 2026 10:283,44645,788,41527,512,0001,095,0002,490,368
5May 7, 2026 10:283,46643,794,37527,704,0001,071,0002,486,272
6May 7, 2026 10:283,46743,908,41727,680,0001,104,0002,478,080
7May 7, 2026 10:283,50945,245,24228,034,0001,095,0002,486,272
8May 7, 2026 10:283,65444,715,32829,210,0001,121,0002,482,176
9May 7, 2026 10:283,66043,233,27029,311,0001,075,0002,494,464