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 listAug 18, 2025 22:33Leon ZhaoLeon ZhaoScore: 11,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 22:3311,324119,319,13792,988,000999,0002,285,568
2Aug 18, 2025 22:3311,335123,978,71393,082,0001,000,0002,482,176
3Aug 18, 2025 22:3311,335122,593,21592,082,0002,001,0002,285,568
4Aug 18, 2025 22:3311,611125,134,08195,369,0001,003,0002,461,696
5Aug 18, 2025 22:3311,613124,444,81594,401,0001,987,0002,285,568
6Aug 18, 2025 22:3311,616127,683,62294,403,0002,008,0002,285,568