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 listSep 12, 2024 12:43Dmitrii KravchenkoDmitrii KravchenkoScore: 45,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2024 12:4345,182400,579,209374,007,0001,000,0002,318,336
2Sep 12, 2024 12:4345,201396,339,952373,170,0002,000,0002,281,472
3Sep 12, 2024 12:4345,205401,975,292375,203,00002,314,240
4Sep 12, 2024 12:4345,225398,410,097374,364,0001,000,0002,281,472
5Sep 12, 2024 12:4345,227402,588,168374,379,0001,001,0002,281,472
6Sep 12, 2024 12:4345,259407,681,757374,648,000999,0002,281,472
7Sep 12, 2024 12:4345,294398,615,918373,945,0001,999,0002,281,472
8Sep 12, 2024 12:4345,320409,314,309374,155,0002,000,0002,281,472
9Sep 12, 2024 12:4345,387401,060,929374,716,0001,998,0002,281,472