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 listNov 3, 2024 21:19zielajzielajScore: 15,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2024 21:1915,074147,332,261123,111,0002,001,0002,535,424
2Nov 3, 2024 21:1915,080146,795,038122,164,0003,004,0002,273,280
3Nov 3, 2024 21:1915,094144,067,148123,275,0002,004,0002,519,040
4Nov 3, 2024 21:1915,110151,941,908125,414,00002,424,832
5Nov 3, 2024 21:1915,111150,897,437124,417,0001,003,0002,273,280
6Nov 3, 2024 21:1915,117147,806,998124,466,0001,003,0002,433,024
7Nov 3, 2024 21:1915,122154,558,401124,509,0001,004,0002,535,424
8Nov 3, 2024 21:1915,125156,302,888124,544,000996,0002,433,024
9Nov 3, 2024 21:1915,193147,244,628125,106,0001,000,0002,535,424