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 5, 2026 09:06flavio87flavio87Score: 43,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 09:0643,098374,921,837290,821,00066,900,0002,347,008
2May 5, 2026 09:0643,105375,166,848290,857,00066,919,0002,351,104
3May 5, 2026 09:0643,145376,406,897290,742,00067,365,0002,338,816
4May 5, 2026 09:0643,154376,496,945290,753,00067,432,0002,351,104
5May 5, 2026 09:0643,194377,039,608290,745,00067,769,0002,347,008
6May 5, 2026 09:0643,210375,294,066291,277,00067,366,0002,347,008
7May 5, 2026 09:0643,235375,835,323290,924,00067,930,0002,347,008
8May 5, 2026 09:0643,235377,931,334290,727,00068,124,0002,347,008
9May 5, 2026 09:0643,288375,950,626291,057,00068,239,0002,342,912