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 3, 2026 14:31CheckHarryCheckHarryScore: 4,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 14:324,32145,659,40034,818,0001,051,0002,113,536
2Sep 3, 2026 14:324,32345,840,88434,863,0001,019,0002,113,536
3Sep 3, 2026 14:324,32545,684,07134,879,0001,019,0002,113,536
4Sep 3, 2026 14:324,32745,762,22134,905,0001,016,0002,113,536
5Sep 3, 2026 14:324,34047,287,54235,008,0001,021,0002,113,536
6Sep 3, 2026 14:324,34445,954,33735,020,0001,037,0002,113,536
7Sep 3, 2026 14:324,46446,909,66736,042,0001,017,0002,113,536
8Sep 3, 2026 14:324,51647,338,98536,472,0001,016,0002,113,536
9Sep 3, 2026 14:324,53547,527,35336,630,0001,018,0002,113,536