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 13:18wnwnScore: 3,632Success
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 13:193,62638,550,96429,067,0001,034,0002,113,536
2Sep 5, 2026 13:193,62638,573,92229,063,0001,033,0002,113,536
3Sep 5, 2026 13:193,62738,570,23529,095,0001,016,0002,113,536
4Sep 5, 2026 13:193,63138,641,47829,128,0001,011,0002,113,536
5Sep 5, 2026 13:193,63238,625,65629,111,0001,037,0002,113,536
6Sep 5, 2026 13:193,82040,851,83830,703,0001,005,0002,113,536
7Sep 5, 2026 13:193,82340,202,81430,693,0001,038,0002,113,536
8Sep 5, 2026 13:193,83040,969,96830,787,0001,007,0002,113,536
9Sep 5, 2026 13:193,85641,193,68230,975,0001,032,0002,113,536