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 listJul 3, 2023 10:29Erdem KeskinErdem KeskinScore: 83,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2023 10:2983,868755,933,875696,108,52402,236,416
2Jul 3, 2023 11:4383,892767,904,362696,303,29002,232,320
3Jul 3, 2023 10:2283,893767,468,842696,308,28202,232,320
4Jul 3, 2023 10:2283,893755,549,335696,312,77602,240,512
5Jul 3, 2023 11:4383,896760,754,688696,338,67002,240,512
6Jul 3, 2023 10:2283,903758,896,635696,398,07602,228,224
7Jul 3, 2023 11:4383,926756,710,367696,581,71402,232,320
8Jul 3, 2023 10:2983,955757,428,579696,829,66602,240,512
9Jul 3, 2023 10:2984,001766,731,328697,206,57202,232,320