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 13:32Victor MerckléVictor MerckléScore: 11,601Success
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 13:3311,567116,885,93235,387,00060,623,0002,121,728stderr
2Aug 25, 2026 13:3311,570116,677,33035,759,00060,274,0002,121,728stderr
3Aug 25, 2026 13:3311,579116,831,64635,810,00060,300,0002,121,728stderr
4Aug 25, 2026 13:3311,581114,177,67835,849,00060,275,0002,121,728stderr
5Aug 25, 2026 13:3311,601119,249,75235,603,00060,693,0002,121,728stderr
6Aug 25, 2026 13:3311,604113,932,47435,883,00060,438,0002,121,728stderr
7Aug 25, 2026 13:3311,625115,060,63135,870,00060,623,0002,125,824stderr
8Aug 25, 2026 13:3311,633117,855,62135,799,00060,761,0002,121,728stderr
9Aug 25, 2026 13:3311,652117,365,98335,745,00060,968,0002,121,728stderr