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:48ivanivanScore: 85,599Success
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:4884,771734,662,031472,732,000230,869,0002,461,696
2Nov 11, 2024 09:4884,860730,712,752472,557,000231,782,0002,453,504
3Nov 11, 2024 09:4885,367737,480,282473,696,000234,849,0002,465,792
4Nov 11, 2024 09:4885,407745,378,827472,921,000235,960,0002,469,888
5Nov 11, 2024 09:4885,599736,647,267473,649,000236,824,0002,457,600
6Nov 11, 2024 09:4885,714739,185,872472,618,000238,807,0002,469,888
7Nov 11, 2024 09:4885,771738,492,297473,933,000237,966,0002,465,792
8Nov 11, 2024 09:4885,883741,672,433473,887,000238,943,0002,457,600
9Nov 11, 2024 09:4886,147743,123,148473,016,000242,008,0002,461,696