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 listDec 26, 2024 22:22Joad NacerJoad NacerScore: 7,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2024 22:227,36282,663,62560,105,0001,001,0002,314,240
2Dec 26, 2024 22:227,42389,679,74361,609,00002,273,280
3Dec 26, 2024 22:227,44788,003,50259,816,0001,993,0002,301,952
4Dec 26, 2024 22:227,49183,948,93959,170,0003,008,0002,306,048
5Dec 26, 2024 22:227,53491,187,49661,522,0001,008,0002,306,048
6Dec 26, 2024 22:227,54494,049,30161,607,0001,009,0002,531,328