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 listDec 9, 2025 21:43pseppsepScore: 48,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 21:4347,521425,460,573394,425,00002,260,992
2Dec 9, 2025 21:4347,688429,577,950394,812,000999,0002,273,280
3Dec 9, 2025 21:4348,142424,175,312395,587,0003,995,0002,273,280
4Dec 9, 2025 21:4348,280428,761,328398,730,0001,998,0002,265,088
5Dec 9, 2025 21:4348,282428,187,061398,739,0001,998,0002,273,280
6Dec 9, 2025 21:4348,285426,211,303396,766,0003,997,0002,375,680
7Dec 9, 2025 21:4348,297427,673,704397,869,0002,999,0002,523,136
8Dec 9, 2025 21:4348,297428,485,842399,869,000999,0002,527,232
9Dec 9, 2025 21:4348,308426,896,603398,959,0001,999,0002,269,184