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 listMar 15, 2026 14:10eldon-chungeldon-chungScore: 47,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 14:1047,526418,443,289393,471,000998,0002,285,568
2Mar 15, 2026 14:1047,546417,586,677392,632,0001,998,0002,285,568
3Mar 15, 2026 14:1047,550422,369,871392,668,0001,998,0002,285,568
4Mar 15, 2026 14:1047,563416,331,774392,776,0001,998,0002,265,088
5Mar 15, 2026 14:1047,567427,350,489393,805,000999,0002,285,568
6Mar 15, 2026 14:1047,591418,846,860393,009,0002,000,0002,277,376