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 07:18George SeabridgeGeorge SeabridgeScore: 8,521Success
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 07:188,50680,492,29569,518,0001,085,0002,113,536
2Aug 2, 2026 07:188,50780,518,33269,516,0001,097,0002,113,536
3Aug 2, 2026 07:188,51080,768,94369,548,0001,088,0002,113,536
4Aug 2, 2026 07:188,52080,600,99469,640,0001,077,0002,113,536
5Aug 2, 2026 07:188,52180,681,51169,521,0001,208,0002,113,536
6Aug 2, 2026 07:188,52480,691,06169,675,0001,082,0002,113,536
7Aug 2, 2026 07:188,52680,742,64969,683,0001,087,0002,113,536
8Aug 2, 2026 07:189,73690,837,00779,727,0001,090,0002,113,536
9Aug 2, 2026 07:189,78992,558,27580,077,0001,179,0002,113,536