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 listJun 6, 2024 10:43matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2024 10:4300000Error: No answer to stdout. Died or killed?
2Jun 6, 2024 10:4300000Error: expected "53687673909198751 ", got "37908 -6948099604077198831 -5926181468980940284 -825745089534241408 -5848907147634992645 -6053507738909859285 1196428930376449376 -2807769298498327096 -2423274319659799099 -4437344709132575393 3792865064222194...stderr
3Jun 6, 2024 10:4400000Error: expected "53688361050801235 ", got "41902 7990268953264792421 5330008557652402414 4390467938066101032 -6405076120309721705 -7256042100448059345 -2359730125619397160 8916041408454984908 5385584441832576708 6661078003542205378 -7023333704157544855...stderr