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 05:09Josu San MartinJosu San MartinError
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 05:09050,810,35233,186,0001,168,0002,482,176expected "53686386338676158 ", got "53686385593361987 "
2May 10, 2026 05:09049,977,80333,312,0001,073,0002,482,176expected "53688310280047078 ", got "53688309922615072 "
3May 10, 2026 05:094,09151,221,21432,834,0001,128,0002,490,368
4May 10, 2026 05:094,10452,467,15632,900,0001,166,0002,482,176
5May 10, 2026 05:094,11148,836,39732,973,0001,153,0002,482,176
6May 10, 2026 05:094,11249,272,74233,089,0001,047,0002,490,368
7May 10, 2026 05:094,11750,547,48433,151,0001,025,0002,494,464
8May 10, 2026 05:094,12450,222,40633,158,0001,072,0002,478,080
9May 10, 2026 05:094,17052,104,29233,544,0001,072,0002,486,272