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 18:46marko1597marko1597Score: 114,987Success
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 18:50113,851955,066,828943,840,0001,129,0002,117,632stderr
2Aug 14, 2026 18:50113,933955,776,625944,405,0001,242,0002,117,632stderr
3Aug 14, 2026 18:50114,507960,472,635949,232,0001,184,0002,117,632stderr
4Aug 14, 2026 18:50114,634961,713,752950,190,0001,274,0002,117,632stderr
5Aug 14, 2026 18:50114,987964,549,591953,390,0001,005,0002,117,632stderr
6Aug 14, 2026 18:50115,033964,845,721953,582,0001,196,0002,117,632stderr
7Aug 14, 2026 18:50115,080965,196,621953,960,0001,204,0002,117,632stderr
8Aug 14, 2026 18:50115,393967,872,732956,759,0001,004,0002,117,632stderr
9Aug 14, 2026 18:50115,540969,722,022957,742,0001,240,0002,117,632stderr