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 26, 2026 21:10Victor MerckléVictor MerckléScore: 4,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 21:104,79848,806,82938,753,0001,073,0002,113,536
2Aug 26, 2026 21:104,80248,892,90138,779,0001,085,0002,113,536
3Aug 26, 2026 21:104,81548,308,31538,679,0001,287,0002,113,536
4Aug 26, 2026 21:104,82948,442,50638,974,0001,110,0002,113,536
5Aug 26, 2026 21:104,84048,443,07839,078,0001,100,0002,113,536
6Aug 26, 2026 21:104,84548,336,55839,182,0001,034,0002,113,536
7Aug 26, 2026 21:104,84948,567,59039,172,0001,080,0002,113,536
8Aug 26, 2026 21:104,89649,640,75039,535,0001,109,0002,113,536
9Aug 26, 2026 21:105,04650,188,49240,868,0001,022,0002,113,536