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 listApr 13, 2026 10:36wnwnScore: 4,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 10:364,02657,674,16432,407,0001,012,0002,502,656
2Apr 13, 2026 10:364,04956,472,92932,590,0001,018,0002,277,376
3Apr 13, 2026 10:364,07660,406,54932,833,000994,0002,277,376
4Apr 13, 2026 10:364,10457,794,53232,063,0002,003,0002,277,376
5Apr 13, 2026 10:364,14459,547,46733,388,0001,011,0002,277,376
6Apr 13, 2026 10:364,23854,655,94033,169,0002,010,0002,490,368
7Apr 13, 2026 10:364,25967,183,78534,337,0001,009,0002,486,272
8Apr 13, 2026 10:364,27358,586,28134,450,0001,013,0002,490,368
9Apr 13, 2026 10:364,29064,383,72734,591,0001,017,0002,277,376