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 11, 2024 01:46Joad NacerJoad NacerScore: 4,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 01:464,48059,300,70234,173,0003,015,0002,334,720
2Oct 11, 2024 01:464,48158,941,57234,181,0003,015,0002,334,720
3Oct 11, 2024 01:464,48957,493,78734,236,0003,020,0002,506,752
4Oct 11, 2024 01:464,56066,042,30535,853,0001,991,0002,506,752
5Oct 11, 2024 01:464,57761,469,47134,992,0002,999,0002,510,848
6Oct 11, 2024 01:464,57861,715,61035,998,0001,999,0002,502,656