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 7, 2026 09:58wnwnScore: 3,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 09:583,38945,215,88727,022,0001,114,0002,490,368
2May 7, 2026 09:583,39144,328,69527,059,0001,091,0002,490,368
3May 7, 2026 09:583,42444,311,40327,373,0001,054,0002,494,464
4May 7, 2026 09:583,56646,441,06428,520,0001,083,0002,494,464
5May 7, 2026 09:583,57246,346,31128,564,0001,087,0002,486,272
6May 7, 2026 09:583,57544,154,61728,564,0001,114,0002,486,272
7May 7, 2026 09:583,58543,941,77928,644,0001,115,0002,478,080
8May 7, 2026 09:583,58644,522,10928,668,0001,102,0002,494,464
9May 7, 2026 09:583,59643,719,05828,776,0001,075,0002,473,984