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 20, 2025 22:15Cameron AavikCameron AavikScore: 34,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2025 22:1534,319310,981,204228,879,00055,970,0002,535,424
2Jan 20, 2025 22:1534,332315,567,839229,967,00054,992,0002,543,616
3Jan 20, 2025 22:1534,353315,130,359228,104,00057,026,0002,535,424
4Jan 20, 2025 22:1534,541314,471,400233,747,00052,942,0002,301,952
5Jan 20, 2025 22:1534,541318,654,891244,738,00041,955,0002,523,136
6Jan 20, 2025 22:1534,614311,342,519217,225,00070,072,0002,306,048
7Jan 20, 2025 22:1534,668317,489,878259,771,00027,975,0002,289,664
8Jan 20, 2025 22:1534,727316,104,712239,193,00049,039,0002,535,424
9Jan 20, 2025 22:1534,957312,554,565202,101,00088,044,0002,306,048