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 listSep 24, 2026 07:32wnwnScore: 3,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 07:323,88341,027,52331,206,0001,030,0002,113,536
2Sep 24, 2026 07:323,88541,115,11931,215,0001,038,0002,113,536
3Sep 24, 2026 07:323,88640,937,17531,211,0001,043,0002,113,536
4Sep 24, 2026 07:323,88841,034,12931,233,0001,038,0002,113,536
5Sep 24, 2026 07:323,89441,121,91231,301,0001,027,0002,113,536
6Sep 24, 2026 07:323,95841,608,74831,766,0001,086,0002,113,536
7Sep 24, 2026 07:324,04542,105,86632,556,0001,021,0002,113,536
8Sep 24, 2026 07:324,04742,391,69232,586,0001,007,0002,113,536
9Sep 24, 2026 07:324,05642,369,83232,630,0001,043,0002,113,536