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 16, 2026 13:17marko1597marko1597Score: 5,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:405,42554,975,62943,892,0001,138,0002,113,536
2Aug 16, 2026 13:405,42755,044,55043,906,0001,139,0002,113,536
3Aug 16, 2026 13:405,46355,328,35544,144,0001,201,0002,113,536
4Aug 16, 2026 13:405,53956,777,85644,829,0001,149,0002,113,536
5Aug 16, 2026 13:405,60157,306,35445,339,0001,152,0002,113,536
6Aug 16, 2026 13:405,66057,765,81945,824,0001,161,0002,113,536
7Aug 16, 2026 13:405,67657,117,19645,963,0001,150,0002,113,536
8Aug 16, 2026 13:405,69157,287,05246,093,0001,144,0002,113,536
9Aug 16, 2026 13:405,92160,011,36747,984,0001,165,0002,113,536