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 24, 2026 16:20Victor MerckléVictor MerckléScore: 6,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 16:216,47962,186,53952,710,0001,071,0002,117,632stderr
2Aug 24, 2026 16:216,47961,962,45652,680,0001,099,0002,117,632stderr
3Aug 24, 2026 16:216,48162,207,30652,745,0001,053,0002,117,632stderr
4Aug 24, 2026 16:216,48662,216,92452,749,0001,093,0002,117,632stderr
5Aug 24, 2026 16:216,50063,071,28152,879,0001,071,0002,117,632stderr
6Aug 24, 2026 16:216,55062,746,85853,317,0001,054,0002,117,632stderr
7Aug 24, 2026 16:216,57362,709,61553,531,0001,033,0002,117,632stderr
8Aug 24, 2026 16:216,58362,999,78553,626,0001,021,0002,117,632stderr
9Aug 24, 2026 16:216,69264,645,71054,506,0001,043,0002,117,632stderr