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 listFeb 15, 2026 22:34wnwnScore: 9,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:348,66095,514,37464,892,0006,988,0002,359,296
2Feb 15, 2026 22:348,66596,288,72961,929,0009,988,0002,498,560
3Feb 15, 2026 22:348,890101,616,53962,820,00010,968,0002,383,872
4Feb 15, 2026 22:349,578107,560,02370,444,0009,057,0002,351,104
5Feb 15, 2026 22:349,650103,773,57671,086,0009,010,0002,465,792
6Feb 15, 2026 22:349,712109,893,92172,549,0008,061,0002,445,312
7Feb 15, 2026 22:349,779103,561,98572,151,0009,018,0002,433,024
8Feb 15, 2026 22:349,797109,113,48875,290,0006,023,0002,478,080
9Feb 15, 2026 22:349,888107,359,77774,067,0008,007,0002,445,312
10Feb 15, 2026 22:349,945108,993,32373,481,0009,059,0002,269,184
11Feb 15, 2026 22:3410,003104,828,07374,021,0009,002,0002,330,624
12Feb 15, 2026 22:3410,249111,494,72076,061,0009,007,0002,293,760