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 1, 2026 16:28Hung T.NguyenHung T.NguyenScore: 57,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 16:2856,956491,294,390469,739,0002,998,0002,301,952
2May 1, 2026 16:2857,014497,070,636472,219,0001,000,0002,555,904
3May 1, 2026 16:2857,059489,230,459471,594,0001,998,0002,424,832
4May 1, 2026 16:2857,065491,704,690471,648,0001,998,0002,297,856
5May 1, 2026 16:2857,076493,572,723471,741,0001,998,0002,363,392
6May 1, 2026 16:2857,083489,862,960470,799,0002,998,0002,457,600
7May 1, 2026 16:2857,163488,101,327471,460,0002,996,0002,359,296
8May 1, 2026 16:2857,223498,976,450472,960,0001,999,0002,363,392
9May 1, 2026 16:2857,290493,707,222474,506,0001,001,0002,367,488