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 28, 2026 21:20Victor MerckléVictor MerckléScore: 5,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 21:215,13851,706,43141,622,0001,025,0002,117,632stderr
2Aug 28, 2026 21:215,13951,594,43641,629,0001,028,0002,117,632stderr
3Aug 28, 2026 21:215,15051,781,69741,717,0001,032,0002,117,632stderr
4Aug 28, 2026 21:215,15251,805,91641,749,0001,020,0002,117,632stderr
5Aug 28, 2026 21:215,15251,788,04241,747,0001,020,0002,117,632stderr
6Aug 28, 2026 21:215,15851,904,53441,795,0001,020,0002,117,632stderr
7Aug 28, 2026 21:215,17951,982,02341,969,0001,022,0002,117,632stderr
8Aug 28, 2026 21:215,26952,807,62742,695,0001,044,0002,117,632stderr
9Aug 28, 2026 21:215,31253,162,96643,070,0001,021,0002,117,632stderr