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 16, 2025 19:09Ian MckibbenIan MckibbenScore: 29,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2025 19:0929,968275,802,179247,734,000998,0002,269,184
2Feb 16, 2025 19:0929,972271,956,266247,772,000999,0002,531,328
3Feb 16, 2025 19:0929,977271,336,906247,808,000999,0002,531,328
4Feb 16, 2025 19:0929,990280,514,526246,915,0001,999,0002,531,328
5Feb 16, 2025 19:0929,990272,315,159247,917,000999,0002,437,120
6Feb 16, 2025 19:0929,990271,081,569247,915,000999,0002,269,184
7Feb 16, 2025 19:0929,991272,187,402246,925,0001,999,0002,428,928
8Feb 16, 2025 19:0929,991268,178,919246,929,0001,999,0002,531,328
9Feb 16, 2025 19:0929,993275,239,714247,945,000999,0002,433,024