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 listOct 14, 2024 00:09Joad NacerJoad NacerScore: 4,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:094,23958,870,39833,170,0002,010,0002,273,280
2Oct 14, 2024 00:094,29666,735,89335,660,00002,269,184
3Oct 14, 2024 00:094,32754,914,55234,920,000997,0002,535,424
4Oct 14, 2024 00:094,36960,052,90534,252,0002,014,0002,531,328
5Oct 14, 2024 00:094,47163,481,61035,104,0002,005,0002,273,280
6Oct 14, 2024 00:094,62272,647,40337,355,0001,009,0002,531,328