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 listFeb 19, 2026 20:31wnwnScore: 5,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 20:315,44770,097,70743,204,0002,009,0002,277,376
2Feb 19, 2026 20:345,45268,094,70844,247,0001,005,0002,502,656
3Feb 19, 2026 20:345,47065,125,08744,396,0001,009,0002,277,376
4Feb 19, 2026 20:345,48668,899,71144,521,0001,011,0002,535,424
5Feb 19, 2026 20:315,49174,426,84444,561,0001,012,0002,277,376
6Feb 19, 2026 20:315,52169,986,63943,830,0001,992,0002,531,328