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 11:56George SeabridgeGeorge SeabridgeScore: 7,831Success
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 11:577,77775,862,73463,535,0001,018,0002,113,536
2Aug 2, 2026 11:577,78774,512,79563,543,0001,090,0002,113,536
3Aug 2, 2026 11:577,80474,814,14963,646,0001,132,0002,113,536
4Aug 2, 2026 11:577,82376,514,52563,837,0001,102,0002,113,536
5Aug 2, 2026 11:577,83175,066,75363,868,0001,134,0002,113,536
6Aug 2, 2026 11:577,83375,829,17563,900,0001,117,0002,113,536
7Aug 2, 2026 11:577,84274,973,58964,000,0001,089,0002,113,536
8Aug 2, 2026 11:577,86075,340,06564,092,0001,150,0002,113,536
9Aug 2, 2026 11:577,93975,885,40964,737,0001,164,0002,113,536