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 listJan 28, 2024 16:18Abhijit RamanAbhijit RamanScore: 1,645,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2023 01:151,641,87313,699,361,63613,627,549,92602,252,800
2Nov 3, 2023 01:151,641,93813,694,313,99813,628,084,28302,252,800
3Jan 28, 2024 16:181,644,21813,708,663,79713,647,005,67202,269,184
4Jan 28, 2024 16:181,645,06413,717,253,10213,654,035,23202,252,800
5Nov 3, 2023 01:151,647,92213,743,855,93013,677,755,33902,265,088
6Jan 28, 2024 16:181,648,34913,745,038,44013,681,294,10602,260,992