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 listDec 11, 2025 15:29Bernard TeoBernard TeoScore: 6,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:296,01170,078,82247,900,0001,995,0002,392,064
2Dec 11, 2025 15:296,01274,202,87148,900,000997,0002,273,280
3Dec 11, 2025 15:296,01380,121,35748,913,000998,0002,273,280
4Dec 11, 2025 15:296,01977,684,92048,955,000999,0002,273,280
5Dec 11, 2025 15:296,02374,055,77148,994,000999,0002,473,984
6Dec 11, 2025 15:296,02679,663,29048,014,0002,000,0002,396,160
7Dec 11, 2025 15:296,02876,808,81248,029,0002,001,0002,273,280
8Dec 11, 2025 15:296,03068,313,39848,045,0002,001,0002,273,280
9Dec 11, 2025 15:296,04775,916,40949,183,0001,003,0002,273,280
10Dec 11, 2025 15:296,04979,292,72048,196,0002,008,0002,273,280
11Dec 11, 2025 15:296,05171,349,82148,217,0002,009,0002,396,160
12Dec 11, 2025 15:296,05675,222,12249,258,0001,005,0002,273,280