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 12, 2026 09:12Victor MerckléVictor MerckléScore: 16,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 09:1316,368144,297,366134,843,0001,018,0002,117,632stderr
2Aug 12, 2026 09:1316,369144,046,983134,861,0001,009,0002,117,632stderr
3Aug 12, 2026 09:1316,371144,363,969134,865,0001,018,0002,117,632stderr
4Aug 12, 2026 09:1316,374144,324,393134,884,0001,022,0002,117,632stderr
5Aug 12, 2026 09:1316,387144,220,357134,936,0001,078,0002,117,632stderr
6Aug 12, 2026 09:1316,387144,375,991135,011,0001,006,0002,117,632stderr
7Aug 12, 2026 09:1316,388144,408,967135,004,0001,021,0002,117,632stderr
8Aug 12, 2026 09:1316,388144,233,213135,020,0001,007,0002,117,632stderr
9Aug 12, 2026 09:1316,393144,503,015135,054,0001,009,0002,117,632stderr