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 7, 2026 16:47TonyTonyScore: 5,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 16:475,89858,758,95946,353,0002,603,0002,113,536
2Aug 7, 2026 16:475,94059,223,37746,730,0002,579,0002,113,536
3Aug 7, 2026 16:475,97159,387,07647,007,0002,560,0002,113,536
4Aug 7, 2026 16:475,97660,664,07747,041,0002,564,0002,113,536
5Aug 7, 2026 16:475,98059,463,34147,064,0002,575,0002,113,536
6Aug 7, 2026 16:475,99959,663,99347,211,0002,586,0002,113,536
7Aug 7, 2026 16:475,99959,618,96147,228,0002,569,0002,113,536
8Aug 7, 2026 16:476,01159,725,18847,309,0002,587,0002,113,536
9Aug 7, 2026 16:476,03359,850,73547,460,0002,615,0002,113,536