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 20, 2025 22:50Cameron AavikCameron AavikScore: 34,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2025 22:5034,138312,334,016220,268,00063,076,0002,310,144
2Jan 20, 2025 22:5034,200315,898,293221,890,00061,969,0002,527,232
3Jan 20, 2025 22:5034,212311,127,125225,969,00057,992,0002,547,712
4Jan 20, 2025 22:5034,438311,874,839227,866,00057,966,0002,289,664
5Jan 20, 2025 22:5034,493312,767,238224,231,00062,063,0002,310,144
6Jan 20, 2025 22:5034,615318,444,706227,241,00060,063,0002,289,664
7Jan 20, 2025 22:5034,797314,528,443241,843,00046,969,0002,289,664
8Jan 20, 2025 22:5049,576438,806,046358,422,00053,062,0002,539,520
9Jan 20, 2025 22:5061,308538,434,392450,873,00057,983,0002,289,664