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 listJan 2, 2023 17:05Bernard TeoBernard TeoScore: 16,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2023 17:0516,294165,176,075134,238,0001,001,0002,273,280
2Jan 2, 2023 17:0516,295160,722,450134,246,0001,001,0002,408,448
3Jan 2, 2023 17:0516,303159,387,847134,315,0001,002,0002,273,280
4Jan 2, 2023 17:0516,305156,225,489133,325,0002,004,0002,273,280
5Jan 2, 2023 17:0516,309158,823,427134,364,0001,002,0002,273,280
6Jan 2, 2023 17:0516,309157,856,032134,363,0001,002,0002,273,280
7Jan 2, 2023 17:0516,314159,671,838134,402,0001,003,0002,273,280
8Jan 2, 2023 17:0516,317159,533,844134,430,0001,003,0002,392,064
9Jan 2, 2023 17:0516,325161,251,373135,501,00002,400,256
10Jan 2, 2023 17:0517,605214,764,345146,123,50502,281,472
11Jan 2, 2023 17:0517,609208,518,448146,151,48302,285,568
12Jan 2, 2023 17:0517,610197,717,158146,160,27402,281,472