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 listFeb 17, 2026 20:39wnwnScore: 7,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 20:396,26575,812,58049,997,0001,999,0002,420,736
2Feb 17, 2026 20:396,34477,634,65250,634,0002,025,0002,351,104
3Feb 17, 2026 20:396,40980,657,98150,184,0003,011,0002,514,944
4Feb 17, 2026 20:397,32494,899,06555,805,0004,982,0002,478,080
5Feb 17, 2026 20:397,46590,932,21358,964,0002,998,0002,478,080
6Feb 17, 2026 20:397,49385,508,61658,179,0004,012,0002,469,888