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 14, 2026 12:57marko1597marko1597Score: 332,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 13:01330,9772,757,112,6352,746,030,0001,083,0002,117,632stderr
2Aug 14, 2026 13:01332,4552,769,392,6012,758,311,0001,069,0002,117,632stderr
3Aug 14, 2026 13:01332,6642,771,226,1642,759,026,0002,093,0002,117,632stderr
4Aug 14, 2026 13:01332,7372,772,389,8442,760,631,0001,089,0002,117,632stderr
5Aug 14, 2026 13:01332,7632,771,984,6132,760,748,0001,187,0002,117,632stderr
6Aug 14, 2026 13:01332,9232,773,829,3772,762,166,0001,098,0002,117,632stderr
7Aug 14, 2026 13:01332,9832,774,069,7962,761,592,0002,168,0002,117,632stderr
8Aug 14, 2026 13:01333,6362,779,381,3722,765,950,0003,231,0002,117,632stderr
9Aug 14, 2026 13:01334,9132,789,798,1362,778,695,0001,091,0002,117,632stderr