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 23, 2026 07:14Kevin HeaveyKevin HeaveyScore: 3,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:163,33537,266,88426,478,0001,208,0002,113,536
2Sep 23, 2026 07:163,35237,385,18326,802,0001,023,0002,113,536
3Sep 23, 2026 07:163,35536,639,86726,705,0001,142,0002,113,536
4Sep 23, 2026 07:163,38445,224,50827,077,0001,015,0002,113,536
5Sep 23, 2026 07:163,39546,608,60027,021,0001,161,0002,113,536
6Sep 23, 2026 07:163,39646,375,12127,180,0001,015,0002,113,536
7Sep 23, 2026 07:163,39844,251,97427,169,0001,042,0002,113,536
8Sep 23, 2026 07:163,41345,389,99027,305,0001,027,0002,113,536
9Sep 23, 2026 07:163,43946,188,89527,332,0001,214,0002,113,536