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 7, 2026 15:12Kevin PetersKevin PetersScore: 62,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:1362,576529,367,062462,394,00056,990,0002,113,536
2Sep 7, 2026 15:1362,576530,633,168462,368,00057,013,0002,113,536
3Sep 7, 2026 15:1362,628529,977,150462,444,00057,371,0002,113,536
4Sep 7, 2026 15:1362,643529,931,089462,292,00057,645,0002,113,536
5Sep 7, 2026 15:1362,674530,137,425462,176,00058,025,0002,113,536
6Sep 7, 2026 15:1362,674530,100,898462,094,00058,102,0002,113,536
7Sep 7, 2026 15:1362,711530,381,715462,272,00058,237,0002,113,536
8Sep 7, 2026 15:1362,827531,426,760462,322,00059,147,0002,113,536
9Sep 7, 2026 15:1362,910532,104,799462,506,00059,652,0002,113,536