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 3, 2025 07:14Rohan KapurRohan KapurScore: 60,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2025 07:1460,940538,553,786504,805,000999,0002,289,664
2Jan 3, 2025 07:1460,945537,971,815503,841,0001,999,0002,371,584
3Jan 3, 2025 07:1460,968525,227,612504,034,0002,000,0002,367,488
4Jan 3, 2025 07:1460,971528,789,328505,056,0001,000,0002,281,472
5Jan 3, 2025 07:1460,983531,313,246504,163,0002,000,0002,367,488
6Jan 3, 2025 07:1460,999537,590,707505,293,0001,000,0002,281,472
7Jan 3, 2025 07:1461,058535,936,630504,780,0001,999,0002,285,568
8Jan 3, 2025 07:1461,117530,985,616506,269,0001,000,0002,285,568
9Jan 3, 2025 07:1461,313535,382,410507,895,000999,0002,285,568