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 listMay 9, 2026 20:06flavio87flavio87Score: 7,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 20:077,39676,573,11460,366,0001,025,0002,379,776
2May 9, 2026 20:077,48378,370,56561,088,0001,024,0002,363,392
3May 9, 2026 20:077,58080,747,31761,897,0001,023,0002,379,776
4May 9, 2026 20:077,59179,683,01861,980,0001,030,0002,330,624
5May 9, 2026 20:077,59881,115,59361,042,0002,022,0002,310,144
6May 9, 2026 20:077,60678,268,96961,091,0002,039,0002,342,912
7May 9, 2026 20:077,60878,015,64361,104,0002,050,0002,363,392
8May 9, 2026 20:077,61777,716,88862,194,0001,029,0002,363,392
9May 9, 2026 20:077,62679,116,46761,255,0002,043,0002,387,968