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 listDec 15, 2025 15:29AndreiAndreiScore: 52,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 15:2952,925469,380,627437,277,0002,001,0002,293,760
2Dec 15, 2025 15:2952,928467,984,536438,306,0001,000,0002,293,760
3Dec 15, 2025 15:2952,929467,410,620437,311,0002,001,0002,551,808
4Dec 15, 2025 15:2952,935456,189,308439,360,00002,547,712
5Dec 15, 2025 15:2952,948464,803,347438,471,0001,001,0002,293,760
6Dec 15, 2025 15:2952,950465,757,110436,489,0002,996,0002,539,520
7Dec 15, 2025 15:2952,972466,326,563435,668,0003,996,0002,539,520
8Dec 15, 2025 15:2952,983469,123,611438,756,000999,0002,539,520
9Dec 15, 2025 15:2953,528477,695,292442,283,0002,001,0002,539,520