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 2, 2026 12:45George SeabridgeGeorge SeabridgeScore: 7,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 12:457,79675,363,58063,613,0001,101,0002,113,536
2Aug 2, 2026 12:457,80074,640,08063,654,0001,089,0002,113,536
3Aug 2, 2026 12:457,81074,717,03563,742,0001,083,0002,113,536
4Aug 2, 2026 12:457,81275,520,02663,758,0001,085,0002,113,536
5Aug 2, 2026 12:457,81574,766,16663,781,0001,088,0002,113,536
6Aug 2, 2026 12:457,82374,853,95563,801,0001,135,0002,113,536
7Aug 2, 2026 12:457,82575,427,63663,862,0001,090,0002,113,536
8Aug 2, 2026 12:457,82674,884,13563,747,0001,212,0002,113,536
9Aug 2, 2026 12:457,95975,969,80964,960,0001,105,0002,113,536