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 listMar 15, 2025 09:18Aryan JainAryan JainScore: 206,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2025 09:18206,5801,741,393,2871,654,624,00059,986,0002,510,848
2Mar 15, 2025 09:18206,5871,742,334,3141,646,685,00067,987,0002,293,760
3Mar 15, 2025 09:18206,8151,740,120,0701,643,584,00072,981,0002,293,760