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 listSep 10, 2026 18:47Victor MerckléVictor MerckléScore: 26,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 18:5126,587229,378,264218,499,0002,181,0002,121,728stderr
2Sep 10, 2026 18:5126,601229,509,920218,597,0002,198,0002,121,728stderr
3Sep 10, 2026 18:5126,663230,817,502219,093,0002,214,0002,121,728stderr
4Sep 10, 2026 18:5126,703230,464,554219,521,0002,120,0002,121,728stderr
5Sep 10, 2026 18:5126,731231,210,832219,745,0002,123,0002,121,728stderr
6Sep 10, 2026 18:5126,748231,454,978219,863,0002,147,0002,121,728stderr
7Sep 10, 2026 18:5126,792231,743,437220,171,0002,205,0002,121,728stderr
8Sep 10, 2026 18:5126,801231,081,833220,340,0002,109,0002,121,728stderr
9Sep 10, 2026 18:5126,845231,509,184220,732,0002,089,0002,121,728stderr