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 listMar 19, 2025 10:05Brandon TangBrandon TangScore: 1,828,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2025 10:051,821,63015,153,339,41615,047,560,00071,969,0002,289,664
2Mar 19, 2025 10:051,824,94515,175,979,74215,073,070,00073,970,0002,281,472
3Mar 19, 2025 10:051,825,50315,182,149,52115,087,705,00063,969,0002,277,376
4Mar 19, 2025 10:051,827,93515,199,773,35815,092,890,00078,968,0002,273,280
5Mar 19, 2025 10:051,828,68615,208,181,37715,102,129,00075,965,0002,277,376
6Mar 19, 2025 10:051,828,70115,209,904,12315,109,249,00068,969,0002,277,376
7Mar 19, 2025 10:051,829,33015,211,003,32015,117,466,00065,971,0002,277,376
8Mar 19, 2025 10:051,829,63415,216,619,79915,113,999,00071,966,0002,289,664
9Mar 19, 2025 10:051,833,84215,263,429,23915,153,914,00066,973,0002,277,376