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 listFeb 10, 2025 02:05natsupercellnatsupercellScore: 1,826,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2025 02:051,823,68115,167,397,30415,068,579,00067,971,0002,277,376
2Feb 10, 2025 02:051,825,49615,179,629,17915,073,646,00077,967,0002,265,088
3Feb 10, 2025 02:051,825,87015,189,110,81415,074,760,00079,961,0002,289,664
4Feb 10, 2025 02:051,825,90315,184,526,87615,080,035,00074,960,0002,277,376
5Feb 10, 2025 02:051,826,01115,186,508,67115,095,923,00059,967,0002,519,040
6Feb 10, 2025 02:051,826,07115,187,210,50315,084,426,00071,963,0002,277,376
7Feb 10, 2025 02:051,826,32815,190,026,99715,100,549,00057,975,0002,277,376
8Feb 10, 2025 02:051,827,41815,197,006,00315,096,600,00070,969,0002,277,376
9Feb 10, 2025 02:051,831,01815,226,231,28715,129,476,00067,970,0002,277,376