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 23, 2024 21:11mahdi739mahdi739Score: 52,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2024 21:1152,798463,743,464437,223,0001,000,0002,285,568
2Dec 23, 2024 21:1152,801459,688,554438,247,00002,379,776
3Dec 23, 2024 21:1152,823464,451,028438,430,00002,359,296
4Dec 23, 2024 21:1152,824470,105,742438,439,00002,367,488
5Dec 23, 2024 21:1152,826467,246,535437,455,0001,001,0002,285,568
6Dec 23, 2024 21:1152,827466,355,109437,466,0001,001,0002,285,568
7Dec 23, 2024 21:1152,844466,052,762436,610,0001,998,0002,375,680
8Dec 23, 2024 21:1152,857464,023,389436,719,0001,998,0002,285,568
9Dec 23, 2024 21:1152,859462,609,360437,730,000999,0002,285,568