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 21, 2025 03:51Cameron AavikCameron AavikScore: 32,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 03:5132,497295,586,095208,785,00060,937,0002,535,424
2Jan 21, 2025 03:5132,565296,342,647208,222,00062,066,0002,293,760
3Jan 21, 2025 03:5132,623299,938,382209,824,00060,948,0002,289,664
4Jan 21, 2025 03:5132,720299,887,833210,445,00061,129,0002,301,952
5Jan 21, 2025 03:5132,735293,318,343205,776,00065,928,0002,293,760
6Jan 21, 2025 03:5132,744294,163,357210,825,00060,949,0002,293,760
7Jan 21, 2025 03:5132,809297,161,016211,245,00061,070,0002,535,424
8Jan 21, 2025 03:5132,823296,095,361212,336,00060,095,0002,535,424
9Jan 21, 2025 03:5134,069308,637,020221,604,00061,166,0002,297,856