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 27, 2022 12:04Vlad ShcherbinaVlad ShcherbinaScore: 363,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 12:03360,9003,052,348,8322,995,474,03502,191,360
2Nov 27, 2022 12:04360,9283,067,679,6322,995,698,84102,187,264
3Nov 27, 2022 12:03362,7603,069,105,1153,010,906,52102,314,240
4Nov 27, 2022 12:03363,2303,076,398,3613,014,808,21402,191,360
5Nov 27, 2022 12:04365,7473,102,155,8983,035,703,25502,195,456
6Nov 27, 2022 12:04367,4093,107,788,2733,049,490,96702,191,360