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 listMar 14, 2026 12:14zielajzielajScore: 3,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 01:553,51160,617,48927,134,0002,009,0002,392,064
2Nov 20, 2024 01:553,52652,032,89727,251,0002,018,0002,473,984
3Nov 20, 2024 01:553,53550,399,37628,331,0001,011,0002,527,232
4Nov 20, 2024 01:553,67850,813,12829,507,0001,017,0002,396,160
5Nov 20, 2024 01:553,68454,364,36729,555,0001,019,0002,498,560
6Nov 20, 2024 01:553,71752,045,12228,864,0001,990,0002,502,656
7Mar 14, 2026 12:153,74655,546,48929,086,0002,005,0002,277,376
8Mar 14, 2026 12:143,78159,497,30630,373,0001,012,0002,531,328
9Mar 14, 2026 12:153,79957,822,86630,517,0001,017,0002,277,376
10Mar 14, 2026 12:143,83661,371,89929,849,0001,989,0002,277,376
11Mar 14, 2026 12:153,83864,545,16829,866,0001,991,0002,269,184
12Mar 14, 2026 12:143,90050,864,28231,360,0001,011,0002,277,376