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 19:25Yuriy LyfenkoYuriy LyfenkoScore: 4,297Success
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 19:254,28255,161,49134,529,0001,015,0002,535,424
2Apr 13, 2026 19:254,28460,962,85534,542,0001,015,0002,478,080
3Apr 13, 2026 19:244,28963,494,93634,579,0001,017,0002,535,424
4Apr 13, 2026 19:244,29564,965,97434,633,0001,018,0002,273,280
5Apr 13, 2026 19:244,29765,488,89534,645,0001,018,0002,473,984
6Apr 13, 2026 19:254,31866,546,99833,851,0001,991,0002,535,424
7Apr 13, 2026 19:254,32958,537,44133,937,0001,996,0002,473,984
8Apr 13, 2026 19:254,33158,766,82533,954,0001,997,0002,535,424
9Apr 13, 2026 19:254,35660,818,58834,144,0002,008,0002,273,280