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 2, 2026 20:22George SeabridgeGeorge SeabridgeScore: 5,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:225,53855,928,42843,647,0002,325,0002,113,536
2Aug 2, 2026 20:225,56556,840,04843,949,0002,245,0002,113,536
3Aug 2, 2026 20:225,57456,211,28543,950,0002,315,0002,113,536
4Aug 2, 2026 20:225,59957,169,80744,184,0002,288,0002,113,536
5Aug 2, 2026 20:225,60056,490,12744,180,0002,301,0002,113,536
6Aug 2, 2026 20:225,60556,388,74744,241,0002,288,0002,113,536
7Aug 2, 2026 20:225,60856,608,91943,498,0003,056,0002,113,536
8Aug 2, 2026 20:225,61858,256,71244,343,0002,287,0002,113,536
9Aug 2, 2026 20:225,66157,692,25744,711,0002,281,0002,113,536