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 listJan 22, 2025 13:51Uladzislau NestsiarukUladzislau NestsiarukScore: 102,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 13:52102,668880,297,442778,132,00074,012,0002,289,664
2Jan 22, 2025 13:51102,728877,223,870780,670,00071,969,0002,367,488
3Jan 22, 2025 13:52102,757876,196,380761,892,00090,987,0002,289,664
4Jan 22, 2025 13:51102,799878,118,863754,203,00099,026,0002,289,664
5Jan 22, 2025 13:51102,913880,749,840773,163,00081,017,0002,355,200
6Jan 22, 2025 13:52102,944888,234,100776,484,00077,948,0002,289,664