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 listApr 27, 2024 12:41Joad NacerJoad NacerScore: 15,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 12:4114,959192,744,090124,158,83702,281,472
2Apr 27, 2024 12:4114,981182,845,156124,338,86602,285,568
3Apr 27, 2024 12:4115,007151,743,616123,551,0001,004,0002,519,040
4Apr 27, 2024 12:4115,021186,983,988124,671,00102,285,568
5Apr 27, 2024 12:4115,042151,891,597122,850,0001,997,0002,285,568
6Apr 27, 2024 12:4115,131156,544,455124,580,0001,004,0002,260,992
7Apr 27, 2024 12:4115,202151,709,181124,171,0002,002,0002,367,488
8Apr 27, 2024 12:4115,279154,086,632126,819,00002,510,848
9Apr 27, 2024 12:4115,399156,916,126125,814,0001,997,0002,265,088
10Apr 27, 2024 12:4115,412157,015,573125,921,0001,998,0002,285,568
11Apr 27, 2024 12:4115,515159,096,141127,778,000998,0002,285,568
12Apr 27, 2024 12:4115,578156,043,660128,294,0001,002,0002,519,040