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 14, 2024 16:00Joad NacerJoad NacerScore: 4,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 16:004,34757,978,81635,077,0001,002,0002,297,856
2Oct 14, 2024 16:004,35358,567,72733,118,0003,010,0002,535,424
3Oct 14, 2024 16:004,38961,013,11435,416,0001,011,0002,306,048
4Oct 14, 2024 16:004,40154,577,70436,532,00002,310,144
5Oct 14, 2024 16:004,51160,580,56637,444,00002,301,952
6Oct 14, 2024 16:004,52165,382,49936,510,0001,014,0002,535,424