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 listAug 26, 2026 20:46Victor MerckléVictor MerckléScore: 7,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:477,25769,789,98559,074,0001,163,0002,113,536
2Aug 26, 2026 20:477,26568,648,09759,171,0001,135,0002,113,536
3Aug 26, 2026 20:477,27968,599,71059,260,0001,158,0002,113,536
4Aug 26, 2026 20:477,29669,574,03859,413,0001,150,0002,113,536
5Aug 26, 2026 20:477,29868,780,95959,311,0001,268,0002,113,536
6Aug 26, 2026 20:477,30969,117,06259,478,0001,191,0002,113,536
7Aug 26, 2026 20:477,36269,743,59959,982,0001,129,0002,113,536
8Aug 26, 2026 20:477,45070,848,39960,756,0001,085,0002,113,536
9Aug 26, 2026 20:477,49171,210,55361,080,0001,097,0002,113,536