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 5, 2026 09:42Kevin HeaveyKevin HeaveyScore: 3,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 09:443,52737,833,82128,224,0001,053,0002,113,536
2Sep 5, 2026 09:443,53437,993,73628,294,0001,046,0002,113,536
3Sep 5, 2026 09:443,54639,841,03028,342,0001,090,0002,113,536
4Sep 5, 2026 09:443,55738,277,89628,487,0001,044,0002,113,536
5Sep 5, 2026 09:443,55937,999,54728,456,0001,086,0002,113,536
6Sep 5, 2026 09:443,60438,593,17028,834,0001,082,0002,113,536
7Sep 5, 2026 09:443,61138,633,17628,913,0001,063,0002,113,536
8Sep 5, 2026 09:443,64740,211,68829,238,0001,034,0002,113,536
9Sep 5, 2026 09:443,80340,124,63430,527,0001,043,0002,113,536