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:27Aryan JainAryan JainScore: 1,943,468Success
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 18:271,939,32016,131,216,80216,034,388,00061,970,0002,277,376
2Dec 28, 2024 18:271,939,36416,128,808,64616,028,746,00067,973,0002,277,376
3Dec 28, 2024 18:271,943,28116,160,999,51716,063,268,00065,968,0002,277,376
4Dec 28, 2024 18:271,943,30116,160,572,99516,057,429,00071,966,0002,289,664
5Dec 28, 2024 18:271,943,46816,164,971,24016,056,820,00073,966,0002,277,376
6Dec 28, 2024 18:271,943,62216,167,609,43316,041,100,00090,966,0002,277,376
7Dec 28, 2024 18:271,943,99516,167,046,50016,046,193,00088,962,0002,277,376
8Dec 28, 2024 18:271,947,63416,196,268,54716,089,391,00075,968,0002,277,376
9Dec 28, 2024 18:272,017,78016,778,236,96016,676,602,00070,972,0002,289,664