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 08:33George SeabridgeGeorge SeabridgeScore: 69,659Success
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 08:3369,496587,485,846575,746,0001,078,0002,113,536
2Aug 2, 2026 08:3369,507586,856,949575,826,0001,083,0002,113,536
3Aug 2, 2026 08:3369,617588,046,007576,741,0001,086,0002,113,536
4Aug 2, 2026 08:3369,651588,075,091576,949,0001,160,0002,113,536
5Aug 2, 2026 08:3369,659588,065,503577,096,0001,080,0002,113,536
6Aug 2, 2026 08:3369,666588,170,649577,153,0001,081,0002,113,536
7Aug 2, 2026 08:3369,765588,947,085577,966,0001,090,0002,113,536
8Aug 2, 2026 08:3370,081592,645,356580,572,0001,102,0002,113,536
9Aug 2, 2026 08:3379,433669,264,959658,226,0001,075,0002,113,536