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 01:03Victor MerckléVictor MerckléScore: 7,551Success
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 01:047,50370,688,99361,156,0001,125,0002,117,632stderr
2Aug 25, 2026 01:047,53070,852,11661,432,0001,073,0002,117,632stderr
3Aug 25, 2026 01:047,54771,086,67761,528,0001,115,0002,117,632stderr
4Aug 25, 2026 01:047,54971,065,70361,519,0001,143,0002,117,632stderr
5Aug 25, 2026 01:047,55171,063,91661,537,0001,140,0002,117,632stderr
6Aug 25, 2026 01:047,56671,191,34661,692,0001,111,0002,117,632stderr
7Aug 25, 2026 01:047,56871,293,88561,676,0001,141,0002,117,632stderr
8Aug 25, 2026 01:047,61271,554,44462,100,0001,083,0002,117,632stderr
9Aug 25, 2026 01:047,72972,545,89063,079,0001,079,0002,117,632stderr