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 listOct 15, 2024 20:41Elnur RakhmatullinElnur RakhmatullinScore: 49,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 20:4149,882445,531,173412,021,0002,000,0002,535,424
2Oct 15, 2024 20:4149,885442,799,581412,044,0002,000,0002,277,376
3Oct 15, 2024 20:4149,895437,338,901412,128,0002,000,0002,277,376
4Oct 15, 2024 20:4149,896442,973,818412,138,0002,000,0002,277,376
5Oct 15, 2024 20:4149,902447,353,572414,189,00002,277,376
6Oct 15, 2024 20:4149,906442,847,526413,219,0001,000,0002,277,376
7Oct 15, 2024 20:4149,908441,417,354413,233,0001,000,0002,273,280
8Oct 15, 2024 20:4149,921442,260,176413,348,0001,000,0002,273,280
9Oct 15, 2024 20:4149,922439,742,005411,348,0003,002,0002,277,376