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 9, 2026 23:45Andrii StolitniiAndrii StolitniiScore: 79,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:4578,771669,281,363592,415,00061,392,0002,342,912
2May 9, 2026 23:4578,826671,269,128592,666,00061,591,0002,347,008
3May 9, 2026 23:4578,884671,463,314592,731,00062,011,0002,351,104
4May 9, 2026 23:4578,943670,411,906592,215,00063,012,0002,359,296
5May 9, 2026 23:4579,002673,969,504592,593,00063,129,0002,359,296
6May 9, 2026 23:4579,029674,668,731592,529,00063,414,0002,351,104
7May 9, 2026 23:4579,045670,699,591592,767,00063,310,0002,351,104
8May 9, 2026 23:4579,075675,753,502593,208,00063,122,0002,363,392
9May 9, 2026 23:4579,469678,300,202593,183,00066,411,0002,359,296