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 listMay 13, 2024 00:03sliceteamsliceteamScore: 16,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2024 00:0316,137157,988,798131,941,0001,999,0002,367,488
2May 13, 2024 00:0316,153162,104,646133,066,0001,000,0002,404,352
3May 13, 2024 00:0316,168155,939,350132,190,0002,002,0002,351,104
4May 13, 2024 00:0316,218164,220,236134,606,00002,367,488
5May 13, 2024 00:0316,265160,844,516134,000,0001,000,0002,404,352
6May 13, 2024 00:0316,317157,589,254133,424,0002,006,0002,404,352
7May 13, 2024 00:0316,416163,476,583134,247,0002,003,0002,347,008
8May 13, 2024 00:0316,518164,998,529135,099,0002,001,0002,375,680
9May 13, 2024 00:0316,653166,454,030135,214,0003,004,0002,502,656
10May 13, 2024 00:0317,086199,683,220141,815,98402,236,416
11May 13, 2024 00:0317,195211,771,300142,718,26402,265,088
12May 13, 2024 00:0317,729205,925,346147,149,52502,236,416