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 listJul 15, 2022 19:14Yuriy LyfenkoYuriy LyfenkoScore: 26,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2022 19:1425,938238,661,220214,282,0001,001,0002,285,568
2Jul 15, 2022 19:1425,946238,396,834214,354,0001,001,0002,285,568
3Jul 15, 2022 19:1425,947234,623,889214,363,0001,001,0002,371,584
4Jul 15, 2022 19:1425,954237,793,571214,414,0001,001,0002,285,568
5Jul 15, 2022 19:1425,965242,285,890214,510,0001,002,0002,285,568
6Jul 15, 2022 19:1426,238246,390,927216,775,000998,0002,285,568
7Jul 15, 2022 19:1426,283242,572,675216,148,0002,001,0002,285,568
8Jul 15, 2022 19:1426,287239,037,724216,181,0002,001,0002,285,568
9Jul 15, 2022 19:1427,131249,380,449224,189,0001,000,0002,277,376
10Jul 15, 2022 19:1427,479295,947,207228,078,55002,285,568
11Jul 15, 2022 19:1427,564289,533,287228,781,39902,285,568
12Jul 15, 2022 19:1428,442300,866,800236,067,98002,277,376