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 25, 2025 21:01haiwwkeshaiwwkesScore: 55,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2025 21:0155,569488,186,922461,221,00002,281,472
2Feb 25, 2025 21:0155,646497,574,632460,865,000999,0002,281,472
3Feb 25, 2025 21:0155,691489,266,651459,232,0003,001,0002,506,752
4Feb 25, 2025 21:0155,704492,021,139461,342,0001,000,0002,281,472
5Feb 25, 2025 21:0155,735490,722,803461,605,000999,0002,293,760
6Feb 25, 2025 21:0155,744489,230,789460,674,0001,998,0002,281,472
7Feb 25, 2025 21:0155,746497,078,071460,696,0001,998,0002,281,472
8Feb 25, 2025 21:0155,766488,335,762460,856,0001,999,0002,281,472
9Feb 25, 2025 21:0155,806490,772,273461,186,0002,000,0002,281,472