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 listApr 10, 2026 15:04Danylo MocherniukDanylo MocherniukScore: 4,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 15:044,56862,405,23735,921,0001,995,0002,490,368
2Apr 10, 2026 15:044,58160,483,33636,025,0002,001,0002,502,656
3Apr 10, 2026 15:044,68168,818,28335,861,0002,988,0002,297,856
4Apr 10, 2026 15:044,68268,986,55637,861,000996,0002,342,912
5Apr 10, 2026 15:044,69962,610,49135,999,0002,999,0002,297,856
6Apr 10, 2026 15:044,77964,244,02636,617,0003,051,0002,297,856
7Apr 10, 2026 15:044,81863,064,82636,989,0002,999,0002,383,872
8Apr 10, 2026 15:044,95769,124,27539,133,0002,006,0002,383,872
9Apr 10, 2026 15:045,01567,975,30339,595,0002,030,0002,387,968