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 10, 2024 19:49Joad NacerJoad NacerScore: 9,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 19:499,374102,353,49375,811,0001,995,0002,486,272
2Oct 10, 2024 19:499,38799,424,71874,918,0002,996,0002,351,104
3Oct 10, 2024 19:499,553101,724,78977,286,0002,007,0002,478,080
4Oct 10, 2024 19:499,610104,589,23076,771,0002,991,0002,486,272
5Oct 10, 2024 19:499,630101,304,53277,927,0001,998,0002,351,104
6Oct 10, 2024 19:499,640103,750,02777,008,0003,000,0002,482,176