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 25, 2026 21:21Kevin HeaveyKevin HeaveyScore: 3,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 21:323,18437,332,67626,430,000020,480
2Sep 25, 2026 21:323,18635,144,92526,447,000020,480
3Sep 25, 2026 21:323,19435,149,23426,516,000020,480
4Sep 25, 2026 21:323,19536,017,58226,523,000020,480
5Sep 25, 2026 21:323,20136,131,97526,575,000020,480
6Sep 25, 2026 21:323,20336,136,85526,586,000020,480
7Sep 25, 2026 21:323,20735,418,01326,619,000020,480
8Sep 25, 2026 21:323,22735,565,39726,789,000020,480
9Sep 25, 2026 21:323,22936,350,61526,807,000020,480