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, 2022 03:40Yevhen KazminYevhen KazminScore: 67,327Success
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, 2022 03:3867,300631,506,264558,589,51802,260,992
2Aug 4, 2022 03:4067,301618,340,119558,596,72002,256,896
3Aug 4, 2022 03:3867,320642,076,645558,755,23102,260,992
4Aug 4, 2022 03:3867,327624,559,963558,815,22302,260,992
5Aug 4, 2022 03:4067,327618,760,239558,814,51402,260,992
6Aug 4, 2022 03:4067,331636,839,700558,845,65102,252,800