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 listJan 1, 2026 19:25Josu San MartinJosu San MartinScore: 8,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 19:258,52496,382,51868,758,0001,992,0002,363,392
2Jan 1, 2026 19:258,52899,171,78667,795,0002,990,0002,363,392
3Jan 1, 2026 19:258,532101,823,78069,816,000997,0002,416,640
4Jan 1, 2026 19:258,80896,807,49266,098,0007,010,0002,314,240
5Jan 1, 2026 19:258,82797,587,18970,253,0003,010,0002,482,176
6Jan 1, 2026 19:258,84293,440,35270,370,0003,015,0002,281,472