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 listDec 28, 2022 03:13Cameron LangerCameron LangerScore: 1,665,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2022 03:131,662,42913,876,953,86113,798,161,58502,252,800
2Dec 28, 2022 03:131,665,65713,887,999,12713,824,951,27602,260,992
3Dec 28, 2022 03:131,668,75113,923,498,68113,850,630,18702,240,512