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 3, 2026 18:19boop34boop34Score: 8,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 18:208,21878,069,26867,033,0001,182,0002,113,536
2Aug 3, 2026 18:208,23378,211,26667,137,0001,198,0002,113,536
3Aug 3, 2026 18:208,24378,290,98067,308,0001,116,0002,113,536
4Aug 3, 2026 18:208,25378,365,97767,290,0001,210,0002,113,536
5Aug 3, 2026 18:208,26478,401,76767,412,0001,181,0002,113,536
6Aug 3, 2026 18:208,26778,545,16467,428,0001,194,0002,113,536
7Aug 3, 2026 18:208,28378,564,32967,554,0001,202,0002,113,536
8Aug 3, 2026 18:208,28978,712,04667,667,0001,138,0002,113,536
9Aug 3, 2026 18:208,30378,791,75367,727,0001,193,0002,113,536