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 listDec 28, 2024 18:17korey-skorey-sScore: 51,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 18:1751,935456,610,871430,061,0001,000,0002,379,776
2Dec 28, 2024 18:1751,939451,317,857429,092,0002,000,0002,367,488
3Dec 28, 2024 18:1751,942454,107,224430,120,0001,000,0002,371,584
4Dec 28, 2024 18:1751,947455,172,337430,158,0001,000,0002,375,680
5Dec 28, 2024 18:1751,955464,842,641431,228,00002,289,664
6Dec 28, 2024 18:1751,960452,836,662431,267,00002,371,584
7Dec 28, 2024 18:1751,963455,831,216431,293,00002,355,200
8Dec 28, 2024 18:1751,984457,881,062431,468,00002,285,568
9Dec 28, 2024 18:1752,005460,936,860430,645,000999,0002,285,568