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 listApr 25, 2024 23:56Joad NacerJoad NacerScore: 30,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2024 23:5630,313310,870,610251,594,48702,273,280
2Apr 25, 2024 23:5630,323332,529,565251,680,41702,269,184
3Apr 25, 2024 23:5630,330313,438,819251,738,20902,404,352