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 listAug 5, 2026 22:42TonyTonyScore: 7,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 22:427,87375,536,63262,790,0002,559,0002,113,536
2Aug 5, 2026 22:427,88475,292,10662,914,0002,526,0002,113,536
3Aug 5, 2026 22:427,91575,564,98863,094,0002,601,0002,113,536
4Aug 5, 2026 22:427,93275,632,27363,320,0002,521,0002,113,536
5Aug 5, 2026 22:427,93975,844,27963,235,0002,662,0002,113,536
6Aug 5, 2026 22:427,94475,806,00163,277,0002,665,0002,113,536
7Aug 5, 2026 22:427,94675,845,28063,845,0002,108,0002,113,536
8Aug 5, 2026 22:427,94975,828,43463,306,0002,673,0002,113,536
9Aug 5, 2026 22:427,96275,943,95063,399,0002,686,0002,113,536