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 listOct 13, 2024 23:50Joad NacerJoad NacerScore: 4,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 23:504,31863,491,75733,848,0001,991,0002,269,184
2Oct 13, 2024 23:504,32361,318,24933,832,0002,050,0002,310,144
3Oct 13, 2024 23:504,33756,787,29234,000,0002,000,0002,273,280
4Oct 13, 2024 23:504,40663,268,78934,541,0002,031,0002,293,760
5Oct 13, 2024 23:504,41863,856,20135,650,0001,018,0002,531,328
6Oct 13, 2024 23:504,48460,629,16036,211,0001,005,0002,535,424