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 18, 2026 06:52Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 06:54073,448,09463,132,0001,058,0002,113,536expected "53682341191109325 ", got "53682318151109325 "
2May 18, 2026 06:547,73072,743,86863,144,0001,015,0002,113,536
3May 18, 2026 06:547,73272,498,28863,128,0001,050,0002,113,536
4May 18, 2026 06:547,73575,041,74063,166,0001,039,0002,113,536
5May 18, 2026 06:547,73773,008,41963,168,0001,056,0002,113,536
6May 18, 2026 06:547,74074,343,53063,187,0001,055,0002,113,536
7May 18, 2026 06:547,77475,051,54863,476,0001,054,0002,113,536
8May 18, 2026 06:547,78372,309,14863,588,0001,014,0002,113,536
9May 18, 2026 06:547,78474,581,30563,595,0001,016,0002,113,536