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 29, 2026 11:31Victor MerckléVictor MerckléScore: 4,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 11:324,93349,309,23639,938,0001,009,0002,117,632stderr
2Aug 29, 2026 11:324,93349,390,34239,930,0001,021,0002,117,632stderr
3Aug 29, 2026 11:324,93449,380,35139,897,0001,059,0002,117,632stderr
4Aug 29, 2026 11:324,94049,386,41939,990,0001,012,0002,117,632stderr
5Aug 29, 2026 11:324,94249,407,58239,999,0001,025,0002,117,632stderr
6Aug 29, 2026 11:325,01149,982,04240,569,0001,028,0002,117,632stderr
7Aug 29, 2026 11:325,08250,567,74041,167,0001,016,0002,117,632stderr
8Aug 29, 2026 11:325,09050,626,07141,232,0001,020,0002,117,632stderr
9Aug 29, 2026 11:325,09151,261,25041,241,0001,022,0002,117,632stderr