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 1, 2026 11:25George SeabridgeGeorge SeabridgeScore: 6,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 11:256,91067,413,92756,262,0001,094,0002,113,536
2Aug 1, 2026 11:256,91067,400,28956,275,0001,082,0002,113,536
3Aug 1, 2026 11:256,91567,365,27056,311,0001,085,0002,113,536
4Aug 1, 2026 11:256,91868,220,19456,340,0001,083,0002,113,536
5Aug 1, 2026 11:256,91968,149,34856,340,0001,093,0002,113,536
6Aug 1, 2026 11:256,92167,449,05156,364,0001,081,0002,113,536
7Aug 1, 2026 11:256,92968,305,87356,428,0001,088,0002,113,536
8Aug 1, 2026 11:258,17877,860,13866,801,0001,084,0002,113,536
9Aug 1, 2026 11:258,19278,829,50066,908,0001,092,0002,113,536