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 18:53KacpxerKacpxerScore: 5,787Success
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 18:535,65157,439,20545,705,0001,201,0002,113,536
2Oct 16, 2026 18:535,68157,660,29845,976,0001,179,0002,113,536
3Oct 16, 2026 18:535,75458,128,04946,599,0001,162,0002,113,536
4Oct 16, 2026 18:535,76358,289,95946,567,0001,271,0002,113,536
5Oct 16, 2026 18:535,78759,848,28046,859,0001,177,0002,113,536
6Oct 16, 2026 18:535,82158,715,79047,136,0001,180,0002,113,536
7Oct 16, 2026 18:535,85759,053,04847,423,0001,195,0002,113,536
8Oct 16, 2026 18:537,29871,189,48259,303,0001,273,0002,113,536
9Oct 16, 2026 18:538,47080,993,63769,291,0001,011,0002,113,536