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 listApr 27, 2024 00:59Joad NacerJoad NacerScore: 15,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 00:5915,774154,762,367129,923,000999,0002,260,992
2Apr 27, 2024 00:5915,787154,671,651130,031,0001,000,0002,285,568
3Apr 27, 2024 00:5915,810158,419,771130,226,0001,001,0002,519,040
4Apr 27, 2024 00:5915,847153,490,664130,529,0001,004,0002,285,568
5Apr 27, 2024 00:5915,850157,476,456130,548,0001,004,0002,510,848
6Apr 27, 2024 00:5915,857163,483,636130,612,0001,004,0002,527,232
7Apr 27, 2024 00:5915,966154,307,075131,516,0001,003,0002,260,992
8Apr 27, 2024 00:5915,966160,418,772132,518,00002,289,664
9Apr 27, 2024 00:5916,368200,775,584135,850,26702,285,568
10Apr 27, 2024 00:5916,517160,773,600135,091,0002,001,0002,285,568
11Apr 27, 2024 00:5916,566200,005,255137,497,76102,285,568
12Apr 27, 2024 00:5916,703202,701,687138,631,48302,252,800