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 25, 2026 15:01Elijah KinElijah KinScore: 47,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 15:0147,609404,377,213394,154,0001,008,0002,113,536
2May 25, 2026 15:0147,630405,699,744394,272,0001,063,0002,113,536
3May 25, 2026 15:0147,636406,080,745394,304,0001,083,0002,113,536
4May 25, 2026 15:0147,640404,701,020394,267,0001,147,0002,113,536
5May 25, 2026 15:0147,644405,064,392394,384,0001,066,0002,113,536
6May 25, 2026 15:0147,648404,985,281394,396,0001,087,0002,113,536
7May 25, 2026 15:0147,650408,513,306394,323,0001,175,0002,113,536
8May 25, 2026 15:0147,660405,195,952394,332,0001,254,0002,113,536
9May 25, 2026 15:0147,662406,466,666394,442,0001,158,0002,113,536