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 12, 2026 01:46Victor MerckléVictor MerckléScore: 3,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 01:473,76539,617,09330,136,0001,116,0002,117,632stderr
2Aug 12, 2026 01:473,76739,670,75030,154,0001,118,0002,117,632stderr
3Aug 12, 2026 01:473,78639,795,02130,339,0001,087,0002,117,632stderr
4Aug 12, 2026 01:473,79639,899,27230,431,0001,078,0002,117,632stderr
5Aug 12, 2026 01:473,80039,966,06630,432,0001,108,0002,117,632stderr
6Aug 12, 2026 01:473,80940,069,01130,490,0001,127,0002,117,632stderr
7Aug 12, 2026 01:473,81039,982,61630,547,0001,082,0002,117,632stderr
8Aug 12, 2026 01:473,82140,139,49330,587,0001,128,0002,117,632stderr
9Aug 12, 2026 01:473,84340,369,62330,884,0001,020,0002,117,632stderr