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 23, 2026 17:38Victor MerckléVictor MerckléScore: 3,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:403,74739,297,32629,987,0001,116,0002,117,632stderr
2Aug 23, 2026 17:403,74839,524,39529,972,0001,144,0002,117,632stderr
3Aug 23, 2026 17:403,75540,244,35630,055,0001,119,0002,117,632stderr
4Aug 23, 2026 17:403,78939,808,58130,372,0001,082,0002,117,632stderr
5Aug 23, 2026 17:403,79039,843,68730,347,0001,118,0002,117,632stderr
6Aug 23, 2026 17:403,79539,875,64830,346,0001,158,0002,117,632stderr
7Aug 23, 2026 17:403,82840,904,29230,638,0001,135,0002,117,632stderr
8Aug 23, 2026 17:403,86840,509,48631,015,0001,095,0002,117,632stderr
9Aug 23, 2026 17:404,05642,800,08232,652,0001,017,0002,117,632stderr