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 25, 2026 03:36Victor MerckléVictor MerckléScore: 7,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 03:377,44570,086,08160,768,0001,028,0002,117,632stderr
2Aug 25, 2026 03:377,45870,192,27360,864,0001,042,0002,117,632stderr
3Aug 25, 2026 03:377,46270,872,25460,894,0001,043,0002,117,632stderr
4Aug 25, 2026 03:377,47171,399,53160,945,0001,071,0002,117,632stderr
5Aug 25, 2026 03:377,48370,437,82661,099,0001,012,0002,117,632stderr
6Aug 25, 2026 03:377,48870,492,72861,126,0001,030,0002,117,632stderr
7Aug 25, 2026 03:377,49470,482,30161,191,0001,011,0002,117,632stderr
8Aug 25, 2026 03:377,50070,531,62461,217,0001,040,0002,117,632stderr
9Aug 25, 2026 03:377,50970,653,77761,299,0001,031,0002,117,632stderr