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 04:23Josu San MartinJosu San MartinScore: 4,431Success
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 04:234,41151,057,99635,521,0001,096,0002,551,808
2May 10, 2026 04:234,41352,449,80335,520,0001,114,0002,543,616
3May 10, 2026 04:234,41855,710,38035,578,0001,098,0002,555,904
4May 10, 2026 04:234,42851,251,56935,595,0001,164,0002,543,616
5May 10, 2026 04:234,43151,857,12035,606,0001,174,0002,551,808
6May 10, 2026 04:234,44854,600,33535,876,0001,050,0002,543,616
7May 10, 2026 04:234,45054,094,68035,910,0001,033,0002,551,808
8May 10, 2026 04:234,45354,812,79035,888,0001,075,0002,555,904
9May 10, 2026 04:234,46251,105,23735,957,0001,078,0002,543,616