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 listJul 3, 2021 12:51Yuriy LyfenkoYuriy LyfenkoScore: 13,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2021 12:5113,491420,892,101111,976,00202,265,088
2Jul 3, 2021 12:5113,492423,582,650111,982,22802,273,280
3Jul 3, 2021 12:5113,493413,020,947111,991,07302,240,512