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 listJun 19, 2026 16:02A_ShamanA_ShamanScore: 64,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 16:0364,104541,308,290472,655,00059,409,0002,113,536
2Jun 19, 2026 16:0364,119541,379,960471,688,00060,500,0002,113,536
3Jun 19, 2026 16:0364,227542,232,748472,403,00060,687,0002,113,536
4Jun 19, 2026 16:0364,232542,417,302472,311,00060,816,0002,113,536
5Jun 19, 2026 16:0364,284542,669,893472,814,00060,750,0002,113,536
6Jun 19, 2026 16:0364,287542,855,173472,283,00061,304,0002,113,536
7Jun 19, 2026 16:0364,321542,945,990473,257,00060,612,0002,113,536
8Jun 19, 2026 16:0364,335543,438,657472,360,00061,621,0002,113,536
9Jun 19, 2026 16:0364,607545,415,828473,803,00062,441,0002,113,536