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 28, 2024 18:22korey-skorey-sScore: 51,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 23:1851,946458,250,251429,153,0002,000,0002,289,664
2Dec 28, 2024 23:1851,953455,212,333430,213,0001,000,0002,355,200
3Dec 28, 2024 23:1851,957452,517,978430,239,0001,000,0002,285,568
4Dec 28, 2024 23:1851,971462,919,508430,356,0001,000,0002,289,664
5Dec 28, 2024 23:1851,973457,754,253430,378,0001,000,0002,367,488
6Dec 28, 2024 18:2251,982465,828,904430,448,0001,001,0002,379,776
7Dec 28, 2024 23:1851,982461,107,732429,455,0001,997,0002,359,296
8Dec 28, 2024 23:1851,985457,992,696430,471,0001,001,0002,289,664
9Dec 28, 2024 18:2251,987457,484,412430,490,0001,001,0002,289,664
10Dec 28, 2024 18:2251,992458,399,848430,534,000998,0002,289,664
11Dec 28, 2024 23:1852,001456,492,512430,607,000999,0002,367,488
12Dec 28, 2024 23:1852,013459,318,351429,712,0001,998,0002,289,664