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 11, 2026 19:27Victor MerckléVictor MerckléScore: 3,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 19:283,92340,829,39531,546,0001,019,0002,117,632stderr
2Aug 11, 2026 19:283,93541,026,07231,649,0001,017,0002,117,632stderr
3Aug 11, 2026 19:283,94341,144,56231,617,0001,112,0002,117,632stderr
4Aug 11, 2026 19:283,94741,212,76531,710,0001,052,0002,117,632stderr
5Aug 11, 2026 19:283,95941,258,33231,817,0001,045,0002,117,632stderr
6Aug 11, 2026 19:283,96341,308,96931,781,0001,117,0002,117,632stderr
7Aug 11, 2026 19:283,96641,145,87831,898,0001,028,0002,117,632stderr
8Aug 11, 2026 19:283,99641,523,75932,069,0001,105,0002,117,632stderr
9Aug 11, 2026 19:284,02341,795,75832,334,0001,057,0002,117,632stderr