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 listFeb 4, 2025 07:06mebowlermebowlerScore: 97,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2025 07:0697,102835,328,871758,948,00046,996,0002,527,232
2Feb 4, 2025 07:0697,109832,130,943747,002,00059,000,0002,334,720
3Feb 4, 2025 07:0697,198830,056,357750,760,00055,982,0002,334,720