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:15Kevin HeaveyKevin HeaveyScore: 3,346Success
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:203,32037,689,61126,408,0001,156,0002,113,536
2Sep 23, 2026 07:203,32736,413,69726,473,0001,147,0002,113,536
3Sep 23, 2026 07:203,33736,544,12426,570,0001,129,0002,113,536
4Sep 23, 2026 07:203,33837,273,86026,693,0001,017,0002,113,536
5Sep 23, 2026 07:203,34637,336,77626,717,0001,055,0002,113,536
6Sep 23, 2026 07:203,34837,655,59926,701,0001,088,0002,113,536
7Sep 23, 2026 07:203,35337,418,12726,769,0001,064,0002,113,536
8Sep 23, 2026 07:203,35337,409,40926,615,0001,220,0002,113,536
9Sep 23, 2026 07:203,36436,731,12726,873,0001,050,0002,113,536