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 listDec 29, 2024 00:32Christopher MullinsChristopher MullinsScore: 53,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 00:3253,212464,264,117439,659,0001,998,0002,400,256
2Dec 29, 2024 00:3253,221468,670,909440,737,000999,0002,359,296
3Dec 29, 2024 00:3253,222465,718,515439,745,0001,998,0002,510,848
4Dec 29, 2024 00:3253,236466,637,448439,857,0001,999,0002,383,872
5Dec 29, 2024 00:3253,246466,886,536438,943,0002,999,0002,355,200
6Dec 29, 2024 00:3253,246462,757,647439,946,0001,999,0002,387,968
7Dec 29, 2024 00:3253,248471,755,490439,962,0001,999,0002,387,968
8Dec 29, 2024 00:3253,277473,733,913440,204,0001,996,0002,355,200
9Dec 29, 2024 00:3253,323469,356,465439,583,0002,997,0002,355,200