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 11, 2024 16:56Joad NacerJoad NacerScore: 4,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 16:564,41561,766,94734,609,0002,035,0002,301,952
2Oct 11, 2024 16:564,43963,898,51835,845,000995,0002,310,144
3Oct 11, 2024 16:564,43961,181,58935,852,000995,0002,535,424
4Oct 11, 2024 16:564,46058,157,76335,014,0002,000,0002,531,328
5Oct 11, 2024 16:564,47257,132,39235,112,0002,006,0002,531,328
6Oct 11, 2024 16:564,48356,995,69435,202,0002,011,0002,392,064