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 11, 2026 13:17Victor MerckléVictor MerckléScore: 4,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 13:184,15642,883,44733,476,0001,022,0002,117,632stderr
2Aug 11, 2026 13:184,16242,926,53433,502,0001,043,0002,117,632stderr
3Aug 11, 2026 13:184,16442,947,24633,538,0001,025,0002,117,632stderr
4Aug 11, 2026 13:184,19143,165,94333,751,0001,037,0002,117,632stderr
5Aug 11, 2026 13:184,20043,320,23733,705,0001,160,0002,117,632stderr
6Aug 11, 2026 13:184,25343,676,95134,267,0001,037,0002,117,632stderr
7Aug 11, 2026 13:184,26543,803,95334,352,0001,053,0002,117,632stderr
8Aug 11, 2026 13:184,29644,024,33934,613,0001,047,0002,117,632stderr
9Aug 11, 2026 13:184,30544,149,98934,621,0001,115,0002,117,632stderr