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 26, 2026 19:12Victor MerckléVictor MerckléScore: 3,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 19:133,77539,741,56030,150,0001,186,0002,117,632stderr
2Aug 26, 2026 19:133,78239,743,69730,164,0001,227,0002,117,632stderr
3Aug 26, 2026 19:133,78739,840,53430,209,0001,225,0002,117,632stderr
4Aug 26, 2026 19:133,79039,853,81030,230,0001,229,0002,117,632stderr
5Aug 26, 2026 19:133,79139,821,62830,337,0001,129,0002,117,632stderr
6Aug 26, 2026 19:133,79940,569,53330,336,0001,199,0002,117,632stderr
7Aug 26, 2026 19:133,80339,975,71530,549,0001,018,0002,117,632stderr
8Aug 26, 2026 19:133,80739,985,16230,484,0001,119,0002,117,632stderr
9Aug 26, 2026 19:133,82440,738,41630,520,0001,226,0002,117,632stderr