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 26, 2024 22:21Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2024 22:2000000Error: No answer to stdout. Died or killed?stderr
2Dec 26, 2024 22:2100000Error: expected "53685197562592749 ", got "53685208239479305 "stderr
3Dec 26, 2024 22:216,19671,123,16948,402,0003,025,0002,297,856
4Dec 26, 2024 22:216,22879,628,25150,680,0001,013,0002,531,328
5Dec 26, 2024 22:216,24481,040,57850,826,000996,0002,306,048
6Dec 26, 2024 22:216,32673,462,36251,494,0001,009,0002,531,328
7Dec 26, 2024 22:216,37972,526,99351,946,000998,0002,535,424
8Dec 26, 2024 22:216,76277,696,85955,125,0001,002,0002,301,952