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 11, 2026 02:07Josu San MartinJosu San MartinScore: 3,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 02:073,86640,010,88530,995,0001,098,0002,113,536
2May 11, 2026 02:073,87041,969,47531,047,0001,077,0002,113,536
3May 11, 2026 02:073,87739,850,55331,132,0001,054,0002,113,536
4May 11, 2026 02:073,88641,121,88931,173,0001,082,0002,113,536
5May 11, 2026 02:073,88943,304,51831,204,0001,075,0002,113,536
6May 11, 2026 02:073,88940,057,24531,182,0001,100,0002,113,536
7May 11, 2026 02:073,90342,199,85031,321,0001,075,0002,113,536
8May 11, 2026 02:073,91942,294,77231,440,0001,093,0002,113,536
9May 11, 2026 02:074,04542,462,40532,491,0001,089,0002,113,536