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 02:02Joad 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 02:0200000Error: expected "53689674068021548 ", got "53689677025266405 "stderr
2Nov 27, 2024 02:0200000Error: expected "53688443065885424 ", got "53688456787747131 "stderr
3Nov 27, 2024 02:024,49765,293,95636,318,0001,008,0002,273,280
4Nov 27, 2024 02:024,52864,952,36636,570,0001,015,0002,535,424
5Nov 27, 2024 02:024,60463,134,64937,211,0001,005,0002,306,048
6Nov 27, 2024 02:024,63459,408,22938,460,00002,301,952
7Nov 27, 2024 02:024,67867,050,49836,840,0001,991,0002,293,760
8Nov 27, 2024 02:024,67965,903,14637,842,000995,0002,306,048