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 12:14wnwnScore: 3,470Success
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 12:193,38538,087,66627,056,0001,040,0002,113,536
2Sep 24, 2026 12:193,44537,372,59127,557,0001,039,0002,113,536
3Sep 24, 2026 12:193,46337,423,90227,736,0001,008,0002,113,536
4Sep 24, 2026 12:193,46938,269,48327,764,0001,031,0002,113,536
5Sep 24, 2026 12:193,47037,548,67127,797,0001,009,0002,113,536
6Sep 24, 2026 12:193,47638,221,68527,813,0001,041,0002,113,536
7Sep 24, 2026 12:194,22643,743,10127,240,0007,841,0002,113,536
8Sep 24, 2026 12:194,31244,565,86827,907,0007,887,0002,113,536
9Sep 24, 2026 12:194,33244,604,68127,940,0008,021,0002,113,536