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 listOct 11, 2025 03:36Marco BarboneMarco BarboneScore: 35,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 03:3832,557295,963,044268,223,0002,001,0002,527,232
2Oct 11, 2025 03:3832,586298,385,107269,465,0001,001,0002,289,664
3Oct 11, 2025 03:3834,273309,664,174283,465,0001,001,0002,265,088
4Oct 11, 2025 03:3635,765319,746,053294,849,0001,998,0002,289,664
5Oct 11, 2025 03:3635,768320,784,577295,876,000999,0002,289,664
6Oct 11, 2025 03:3635,793320,982,630296,078,0001,000,0002,265,088