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 listOct 10, 2024 23:31Joad NacerJoad NacerScore: 7,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 23:317,71185,102,26062,000,0002,000,0002,510,848
2Oct 10, 2024 23:317,71389,695,43362,017,0002,000,0002,510,848
3Oct 10, 2024 23:317,73087,530,06463,161,0001,002,0002,514,944
4Oct 10, 2024 23:317,89186,044,21965,496,00002,506,752
5Oct 10, 2024 23:317,89695,497,94363,519,0002,016,0002,510,848
6Oct 10, 2024 23:317,89896,858,90164,544,0001,008,0002,342,912