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 03:21Josu 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 03:21051,424,44537,523,0001,031,0002,486,272expected "53679788258103563 ", got "53679787947604237 "
2May 10, 2026 03:214,60355,371,82737,029,0001,176,0002,482,176
3May 10, 2026 03:214,61054,950,64537,214,0001,056,0002,482,176
4May 10, 2026 03:214,61356,265,19937,250,0001,043,0002,486,272
5May 10, 2026 03:214,61951,203,40137,236,0001,106,0002,482,176
6May 10, 2026 03:214,62552,498,10937,289,0001,102,0002,478,080
7May 10, 2026 03:214,62654,738,68037,319,0001,077,0002,486,272
8May 10, 2026 03:214,64756,686,38737,525,0001,052,0002,478,080
9May 10, 2026 03:214,70957,104,69738,046,0001,044,0002,494,464