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 24, 2026 19:13Victor MerckléVictor MerckléScore: 3,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:143,84040,245,86630,654,0001,224,0002,117,632stderr
2Aug 24, 2026 19:143,84540,419,98530,820,0001,096,0002,117,632stderr
3Aug 24, 2026 19:143,84640,299,04730,841,0001,089,0002,117,632stderr
4Aug 24, 2026 19:143,85040,301,67830,869,0001,088,0002,117,632stderr
5Aug 24, 2026 19:143,86341,105,45230,938,0001,132,0002,117,632stderr
6Aug 24, 2026 19:143,92140,923,46131,386,0001,165,0002,117,632stderr
7Aug 24, 2026 19:143,93541,140,66031,538,0001,124,0002,117,632stderr
8Aug 24, 2026 19:144,14242,761,91033,232,0001,151,0002,117,632stderr
9Aug 24, 2026 19:144,14443,505,17533,329,0001,074,0002,117,632stderr