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 10, 2026 19:07Josu San MartinJosu San MartinScore: 3,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 19:073,88139,835,21331,091,0001,129,0002,113,536
2May 10, 2026 19:073,88340,563,38231,115,0001,119,0002,113,536
3May 10, 2026 19:073,88441,662,04931,126,0001,114,0002,113,536
4May 10, 2026 19:073,88642,392,96231,161,0001,100,0002,113,536
5May 10, 2026 19:073,89540,587,64331,186,0001,147,0002,113,536
6May 10, 2026 19:073,90142,022,98931,250,0001,131,0002,113,536
7May 10, 2026 19:073,90240,284,45531,244,0001,146,0002,113,536
8May 10, 2026 19:073,90741,662,28631,283,0001,151,0002,113,536
9May 10, 2026 19:073,90940,055,63731,435,0001,016,0002,113,536