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 listSep 12, 2026 15:57Kevin HeaveyKevin HeaveyScore: 3,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 15:583,66940,823,74029,418,0001,041,0002,117,632
2Sep 12, 2026 15:583,67342,077,69629,451,0001,040,0002,117,632
3Sep 12, 2026 15:583,71541,115,20229,797,0001,042,0002,117,632
4Sep 12, 2026 15:583,72642,694,45329,708,0001,223,0002,117,632
5Sep 12, 2026 15:583,77341,558,90030,283,0001,040,0002,117,632
6Sep 12, 2026 15:583,85242,280,13030,933,0001,045,0002,117,632
7Sep 12, 2026 15:583,90042,977,93131,130,0001,241,0002,117,632
8Sep 12, 2026 15:583,97543,208,65931,910,0001,085,0002,117,632
9Sep 12, 2026 15:584,02243,833,83832,317,0001,073,0002,117,632