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 listAug 2, 2026 19:46TonyTonyScore: 9,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 19:469,34687,331,12875,111,0002,462,0002,113,536
2Aug 2, 2026 19:469,42788,098,64975,797,0002,448,0002,113,536
3Aug 2, 2026 19:469,44888,261,99875,948,0002,473,0002,113,536
4Aug 2, 2026 19:469,46388,438,21176,062,0002,483,0002,113,536
5Aug 2, 2026 19:469,46988,367,04275,979,0002,621,0002,113,536
6Aug 2, 2026 19:469,49088,599,47976,338,0002,435,0002,113,536
7Aug 2, 2026 19:469,53298,304,48076,646,0002,474,0002,113,536
8Aug 2, 2026 19:469,54089,032,53076,585,0002,605,0002,113,536
9Aug 2, 2026 19:469,55789,169,03676,624,0002,707,0002,113,536