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 20:55George SeabridgeGeorge SeabridgeScore: 5,613Success
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 20:555,49155,570,17243,516,0002,066,0002,113,536
2Aug 2, 2026 20:555,53555,981,65643,633,0002,310,0002,113,536
3Aug 2, 2026 20:555,59656,407,73644,186,0002,268,0002,113,536
4Aug 2, 2026 20:555,59956,803,06144,140,0002,335,0002,113,536
5Aug 2, 2026 20:555,61357,442,45944,331,0002,262,0002,113,536
6Aug 2, 2026 20:555,62456,548,06344,455,0002,228,0002,113,536
7Aug 2, 2026 20:555,66556,967,60344,697,0002,323,0002,113,536
8Aug 2, 2026 20:555,67457,080,98944,847,0002,252,0002,113,536
9Aug 2, 2026 20:555,67557,025,12844,806,0002,299,0002,113,536