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 listNov 11, 2024 09:51Anatoly ZhmurAnatoly ZhmurScore: 82,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 09:5182,770713,350,769627,993,00058,999,0002,494,464
2Nov 11, 2024 09:5182,817719,135,859630,350,00057,031,0002,519,040
3Nov 11, 2024 09:5182,872718,850,342630,848,00056,986,0002,494,464
4Nov 11, 2024 09:5182,889717,254,772628,980,00058,998,0002,527,232
5Nov 11, 2024 09:5182,898712,577,578628,046,00060,004,0002,510,848
6Nov 11, 2024 09:5182,906712,392,347627,109,00061,010,0002,297,856
7Nov 11, 2024 09:5182,913717,187,499628,336,00059,841,0002,310,144
8Nov 11, 2024 09:5182,921713,088,054627,220,00061,021,0002,297,856
9Nov 11, 2024 09:5183,330720,365,950628,767,00062,876,0002,555,904