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 12:33CheckHarryCheckHarryScore: 4,409Success
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 12:344,23844,939,52034,162,0001,016,0002,113,536
2Sep 3, 2026 12:344,26245,291,71834,359,0001,018,0002,113,536
3Sep 3, 2026 12:344,36045,984,53635,173,0001,017,0002,113,536
4Sep 3, 2026 12:344,40946,488,05935,580,0001,016,0002,113,536
5Sep 3, 2026 12:344,40946,333,68935,578,0001,023,0002,113,536
6Sep 3, 2026 12:344,41146,478,92635,602,0001,015,0002,113,536
7Sep 3, 2026 12:344,45346,745,01535,952,0001,016,0002,113,536
8Sep 3, 2026 12:344,46546,905,04736,045,0001,017,0002,113,536
9Sep 3, 2026 12:344,48047,053,69436,170,0001,015,0002,113,536