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 23, 2026 08:14Kevin HeaveyKevin HeaveyScore: 3,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:153,34236,528,11526,645,0001,098,0002,113,536
2Sep 23, 2026 08:153,35536,449,68126,718,0001,132,0002,113,536
3Sep 23, 2026 08:153,36637,506,75626,759,0001,185,0002,113,536
4Sep 23, 2026 08:153,36739,484,19026,763,0001,186,0002,113,536
5Sep 23, 2026 08:153,37337,552,88026,819,0001,180,0002,113,536
6Sep 23, 2026 08:153,38237,564,62826,962,0001,113,0002,113,536
7Sep 23, 2026 08:153,39937,026,41127,086,0001,131,0002,113,536
8Sep 23, 2026 08:153,40946,491,84627,267,0001,034,0002,113,536
9Sep 23, 2026 08:153,41045,067,85627,262,0001,043,0002,113,536