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 listAug 4, 2024 15:40Kasper KivimäkiKasper KivimäkiScore: 58,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2024 15:4057,970537,462,528481,150,48102,244,608
2Aug 4, 2024 06:2457,971542,789,657481,157,07802,371,584
3Aug 4, 2024 06:2458,000543,495,214481,398,16102,240,512
4Aug 4, 2024 06:2458,013542,636,065481,504,74702,240,512
5Aug 4, 2024 15:4058,039554,358,982481,722,48702,363,392
6Aug 4, 2024 15:4058,202558,294,195483,073,92802,240,512