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 listSep 23, 2026 08:45Kevin HeaveyKevin HeaveyScore: 3,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:533,22035,562,16125,599,0001,133,0002,113,536
2Sep 23, 2026 08:533,22535,425,10525,615,0001,159,0002,113,536
3Sep 23, 2026 08:533,22935,630,68925,638,0001,166,0002,113,536
4Sep 23, 2026 08:533,23336,437,72925,798,0001,036,0002,113,536
5Sep 23, 2026 08:533,23535,687,33425,836,0001,016,0002,113,536
6Sep 23, 2026 08:533,23735,667,92825,845,0001,030,0002,113,536
7Sep 23, 2026 08:533,24636,574,74325,754,0001,193,0002,113,536
8Sep 23, 2026 08:533,25236,444,79025,969,0001,026,0002,113,536
9Sep 23, 2026 08:533,25535,916,69425,874,0001,143,0002,113,536