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 listFeb 11, 2026 19:24olliecrowolliecrowScore: 6,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:245,91876,673,91445,111,0004,009,0002,473,984
2Feb 11, 2026 19:245,93277,773,15642,205,0007,034,0002,396,160
3Feb 11, 2026 19:246,02974,644,46541,036,0009,007,0002,506,752
4Feb 11, 2026 19:246,36984,492,72641,894,00010,972,0002,342,912
5Feb 11, 2026 19:246,41881,681,84045,229,0008,040,0002,473,984
6Feb 11, 2026 19:246,65884,732,21748,228,0007,033,0002,478,080