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 6, 2026 03:00CheckHarryCheckHarryScore: 3,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:003,91942,361,41431,502,0001,027,0002,113,536
2Sep 6, 2026 03:003,92142,428,28731,530,0001,019,0002,113,536
3Sep 6, 2026 03:003,92242,398,19031,544,0001,011,0002,113,536
4Sep 6, 2026 03:003,93042,497,88331,610,0001,009,0002,113,536
5Sep 6, 2026 03:003,93242,536,85231,614,0001,022,0002,113,536
6Sep 6, 2026 03:003,93342,532,24631,631,0001,015,0002,113,536
7Sep 6, 2026 03:003,94742,699,93131,757,0001,011,0002,113,536
8Sep 6, 2026 03:003,96242,871,99131,877,0001,015,0002,113,536
9Sep 6, 2026 03:004,12444,139,29533,211,0001,019,0002,113,536