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 listMay 9, 2026 12:36wnwnScore: 3,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 12:373,48343,028,23327,819,0001,092,0002,494,464
2May 9, 2026 12:373,53443,405,89728,264,0001,069,0002,486,272
3May 9, 2026 12:373,53646,622,16128,279,0001,073,0002,490,368
4May 9, 2026 12:373,53644,086,67228,310,0001,046,0002,486,272
5May 9, 2026 12:373,55141,836,74828,422,0001,052,0002,486,272
6May 9, 2026 12:373,55245,381,77328,414,0001,070,0002,490,368
7May 9, 2026 12:373,56747,064,09428,533,0001,076,0002,486,272
8May 9, 2026 12:373,56744,704,01428,490,0001,118,0002,482,176
9May 9, 2026 12:373,58544,301,91428,694,0001,066,0002,490,368