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 16, 2026 15:23marko1597marko1597Score: 4,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 15:254,90149,794,85639,673,0001,007,0002,117,632
2Aug 16, 2026 15:254,92249,309,76739,832,0001,021,0002,117,632
3Aug 16, 2026 15:254,94050,109,72839,887,0001,123,0002,117,632
4Aug 16, 2026 15:254,97650,463,77240,281,0001,021,0002,117,632
5Aug 16, 2026 15:254,98549,898,78640,371,0001,011,0002,117,632
6Aug 16, 2026 15:255,01450,111,22040,607,0001,013,0002,117,632
7Aug 16, 2026 15:255,05850,502,31640,977,0001,010,0002,117,632
8Aug 16, 2026 15:255,11760,973,50441,428,0001,044,0002,117,632
9Aug 16, 2026 15:255,24852,065,71942,547,0001,012,0002,117,632