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:34Kevin HeaveyKevin HeaveyScore: 3,233Success
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:393,21435,522,15525,546,0001,138,0002,113,536
2Sep 23, 2026 08:393,22835,637,87425,787,0001,011,0002,113,536
3Sep 23, 2026 08:393,22939,120,24125,789,0001,014,0002,113,536
4Sep 23, 2026 08:393,22936,389,08725,609,0001,195,0002,113,536
5Sep 23, 2026 08:393,23335,637,92425,815,0001,026,0002,113,536
6Sep 23, 2026 08:393,23435,689,86825,830,0001,013,0002,113,536
7Sep 23, 2026 08:393,24436,574,35225,910,0001,023,0002,113,536
8Sep 23, 2026 08:393,24736,512,01425,927,0001,030,0002,113,536
9Sep 23, 2026 08:393,25236,622,68925,966,0001,032,0002,113,536