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:01TonyTonyScore: 32,582Success
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:0132,150276,674,080265,661,0001,190,0002,113,536
2Aug 2, 2026 08:0132,157276,727,014265,810,0001,101,0002,113,536
3Aug 2, 2026 08:0132,333278,259,320267,108,0001,259,0002,113,536
4Aug 2, 2026 08:0132,546280,053,043269,028,0001,112,0002,113,536
5Aug 2, 2026 08:0132,582280,325,156269,178,0001,260,0002,113,536
6Aug 2, 2026 08:0132,608280,566,774269,466,0001,181,0002,113,536
7Aug 2, 2026 08:0132,642280,810,409269,723,0001,209,0002,113,536
8Aug 2, 2026 08:0132,675280,981,109270,007,0001,200,0002,113,536
9Aug 2, 2026 08:0132,723281,410,619270,416,0001,192,0002,113,536