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 listOct 16, 2026 20:11e1011e1011Score: 36,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 20:1336,087310,113,035298,359,0001,164,0002,113,536
2Oct 16, 2026 20:1336,099310,236,767298,463,0001,164,0002,113,536
3Oct 16, 2026 20:1336,125313,276,304298,838,0001,004,0002,113,536
4Oct 16, 2026 20:1336,145310,790,208298,831,0001,177,0002,113,536
5Oct 16, 2026 20:1336,195311,119,593299,237,0001,185,0002,113,536
6Oct 16, 2026 20:1336,348312,417,540300,689,0001,007,0002,113,536
7Oct 16, 2026 20:1336,447313,164,675301,512,0001,003,0002,113,536
8Oct 16, 2026 20:1336,724317,284,436303,546,0001,266,0002,113,536
9Oct 16, 2026 20:1336,744315,936,393303,976,0001,003,0002,113,536