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 19:31sheryllynn24sheryllynn24Score: 6,470Success
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 19:316,34578,587,49551,654,0001,012,0002,281,472
2Sep 26, 2025 19:316,36479,900,51951,828,000996,0002,269,184
3Sep 26, 2025 19:316,36979,933,44250,871,0001,994,0002,285,568
4Sep 26, 2025 19:316,47083,655,39953,698,00002,260,992
5Sep 26, 2025 19:316,48480,041,41651,822,0001,993,0002,285,568
6Sep 26, 2025 19:316,49185,578,08851,879,0001,995,0002,519,040