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 listNov 27, 2024 01:58Joad 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
1Nov 27, 2024 01:5700000Error: expected "53688252917405802 ", got "53688272851069521 "stderr
2Nov 27, 2024 01:5800000Error: expected "53688683694644995 ", got "53688688296972910 "stderr
3Nov 27, 2024 01:5800000Error: No answer to stdout. Died or killed?stderr
4Nov 27, 2024 01:584,29660,457,42833,623,0002,037,0002,306,048
5Nov 27, 2024 01:584,31858,873,56833,851,0001,991,0002,297,856
6Nov 27, 2024 01:584,34861,175,61735,086,0001,002,0002,531,328
7Nov 27, 2024 01:584,44161,880,85534,865,0001,992,0002,535,424
8Nov 27, 2024 01:584,64964,061,80737,569,0001,015,0002,269,184
9Nov 27, 2024 01:584,75968,383,19337,471,0002,025,0002,301,952