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 27, 2026 00:51Victor MerckléVictor MerckléScore: 4,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 00:524,23343,729,86934,003,0001,139,0002,117,632stderr
2Aug 27, 2026 00:524,24343,679,06234,041,0001,176,0002,117,632stderr
3Aug 27, 2026 00:524,25944,042,69034,251,0001,105,0002,117,632stderr
4Aug 27, 2026 00:524,26243,754,94634,204,0001,174,0002,117,632stderr
5Aug 27, 2026 00:524,27643,886,33834,384,0001,108,0002,117,632stderr
6Aug 27, 2026 00:524,28043,905,68234,434,0001,098,0002,117,632stderr
7Aug 27, 2026 00:524,31944,253,24834,776,0001,074,0002,117,632stderr
8Aug 27, 2026 00:524,33144,978,18534,791,0001,161,0002,117,632stderr
9Aug 27, 2026 00:524,56846,295,18136,828,0001,089,0002,117,632stderr