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 listSep 26, 2025 16:36sheryllynn24sheryllynn24Score: 6,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 16:366,64184,810,06853,114,0002,004,0002,285,568
2Sep 26, 2025 16:366,64283,973,08153,121,0002,004,0002,285,568
3Sep 26, 2025 16:366,64290,124,85653,126,0002,004,0002,265,088
4Sep 26, 2025 16:366,64480,219,32553,144,0002,005,0002,285,568
5Sep 26, 2025 16:366,64483,670,12153,142,0002,005,0002,285,568
6Sep 26, 2025 16:366,64579,887,33254,155,0001,002,0002,269,184
7Sep 26, 2025 16:366,64582,288,17353,145,0002,005,0002,510,848
8Sep 26, 2025 16:366,65084,857,79653,188,0002,007,0002,285,568
9Sep 26, 2025 16:366,65390,625,41953,211,0002,007,0002,273,280