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 listMar 23, 2025 17:21Alexander KosachevAlexander KosachevScore: 387,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2025 17:23386,9663,235,836,7273,211,818,00002,523,136
2Mar 23, 2025 17:23387,1643,232,808,2253,212,466,000999,0002,527,232
3Mar 23, 2025 17:21387,1923,242,513,3553,210,694,0002,997,0002,519,040
4Mar 23, 2025 17:21387,3903,239,967,3353,213,339,0001,998,0002,527,232
5Mar 23, 2025 17:23387,4653,237,266,2123,214,962,000999,0002,531,328
6Mar 23, 2025 17:21387,5033,245,129,3023,216,273,00002,269,184