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 listJul 30, 2026 15:45CodeReclaimersCodeReclaimersScore: 14,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 15:4614,044127,331,413115,320,0001,250,0002,113,536
2Jul 30, 2026 15:4614,051127,541,010115,382,0001,247,0002,113,536
3Jul 30, 2026 15:4614,066126,810,993115,503,0001,251,0002,113,536
4Jul 30, 2026 15:4614,187128,607,997116,610,0001,144,0002,113,536
5Jul 30, 2026 15:4614,557131,564,554119,546,0001,279,0002,113,536
6Jul 30, 2026 15:4615,424138,091,303126,761,0001,266,0002,113,536
7Jul 30, 2026 15:4615,461139,169,499127,095,0001,238,0002,113,536
8Jul 30, 2026 15:4615,537139,769,109127,783,0001,177,0002,113,536
9Jul 30, 2026 15:4615,636140,509,562128,606,0001,175,0002,113,536