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 2, 2026 18:23CheckHarryCheckHarryScore: 6,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 18:236,10260,576,61449,622,0001,027,0002,113,536
2Sep 2, 2026 18:236,12660,737,87249,822,0001,027,0002,113,536
3Sep 2, 2026 18:236,13060,701,06149,853,0001,028,0002,113,536
4Sep 2, 2026 18:236,13260,736,02349,606,0001,293,0002,113,536
5Sep 2, 2026 18:236,13560,693,15949,894,0001,029,0002,113,536
6Sep 2, 2026 18:236,14560,852,33249,977,0001,027,0002,113,536
7Sep 2, 2026 18:236,15460,945,04950,055,0001,027,0002,113,536
8Sep 2, 2026 18:236,15560,846,99950,066,0001,027,0002,113,536
9Sep 2, 2026 18:236,19961,371,84950,430,0001,027,0002,113,536