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 listJan 13, 2025 15:24Advait IyerAdvait IyerScore: 66,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 15:0966,250575,960,124547,879,0001,999,0002,281,472
2Jan 13, 2025 15:0966,274575,757,434549,075,0001,000,0002,281,472
3Jan 13, 2025 15:0966,275577,443,604548,080,0002,000,0002,289,664
4Jan 13, 2025 15:0966,278576,972,498549,110,0001,000,0002,289,664
5Jan 13, 2025 15:0966,282576,851,099548,142,0002,000,0002,269,184
6Jan 13, 2025 15:2466,285580,175,607549,167,0001,000,0002,519,040
7Jan 13, 2025 15:2466,292577,566,609549,226,0001,000,0002,289,664
8Jan 13, 2025 15:0966,297576,913,395548,266,0002,000,0002,289,664
9Jan 13, 2025 15:0966,304573,954,280549,322,0001,000,0002,289,664
10Jan 13, 2025 15:0966,305579,589,014549,334,0001,000,0002,277,376
11Jan 13, 2025 15:2466,339576,736,302550,613,00002,289,664
12Jan 13, 2025 15:0966,346581,055,303548,672,0001,998,0002,289,664