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 listDec 29, 2025 06:05Josu San MartinJosu San MartinScore: 30,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 06:0530,579279,089,688249,807,0003,996,0002,269,184
2Dec 29, 2025 06:0530,587276,121,473252,870,000999,0002,269,184
3Dec 29, 2025 06:0530,597287,066,920251,955,0001,999,0002,269,184
4Dec 29, 2025 06:0530,597278,805,839252,956,000999,0002,269,184
5Dec 29, 2025 06:0530,598277,327,073250,962,0002,999,0002,510,848
6Dec 29, 2025 06:0530,602276,665,713251,997,0001,999,0002,269,184
7Dec 29, 2025 06:0530,608277,185,139251,049,0003,000,0002,396,160
8Dec 29, 2025 06:0530,612276,643,072252,077,0002,000,0002,269,184
9Dec 29, 2025 06:0530,692281,543,295250,748,0003,995,0002,404,352