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 27, 2026 07:53wnwnScore: 3,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 07:543,40842,751,04927,278,0001,010,0002,494,464
2Apr 27, 2026 07:543,44948,017,55627,607,0001,022,0002,482,176
3Apr 27, 2026 07:543,45840,923,33126,727,0001,979,0002,486,272
4Apr 27, 2026 07:543,46548,138,58126,778,0001,983,0002,486,272
5Apr 27, 2026 07:543,53748,643,50428,348,0001,012,0002,486,272
6Apr 27, 2026 07:543,57242,840,84828,628,0001,022,0002,482,176
7Apr 27, 2026 07:543,58545,560,31127,779,0001,984,0002,486,272
8Apr 27, 2026 07:543,60643,367,43427,938,0001,995,0002,330,624
9Apr 27, 2026 07:543,61648,991,96928,014,0002,001,0002,482,176