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 15, 2026 22:41marko1597marko1597Score: 136,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 23:11135,2471,133,301,8861,121,320,0001,238,0002,117,632stderr
2Aug 15, 2026 23:11135,5341,135,069,9591,123,930,0001,006,0002,117,632stderr
3Aug 15, 2026 23:11135,6331,135,844,3561,124,758,0001,003,0002,117,632stderr
4Aug 15, 2026 23:11135,9971,138,910,5431,127,779,0001,003,0002,117,632stderr
5Aug 15, 2026 23:11136,0141,140,275,7381,127,920,0001,002,0002,117,632stderr
6Aug 15, 2026 23:11136,0321,139,891,4891,128,066,0001,003,0002,117,632stderr
7Aug 15, 2026 23:11136,2681,141,085,7101,129,842,0001,186,0002,117,632stderr
8Aug 15, 2026 23:11136,3631,142,817,4821,129,772,0002,043,0002,117,632stderr
9Aug 15, 2026 23:11136,3741,142,756,6121,130,663,0001,248,0002,117,632stderr