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 11, 2024 03:21Joad NacerJoad NacerScore: 4,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 03:214,70059,354,12637,014,0002,000,0002,510,848
2Oct 11, 2024 03:214,70466,882,88036,044,0003,003,0002,334,720
3Oct 11, 2024 03:214,71564,873,88136,124,0003,010,0002,347,008
4Oct 11, 2024 03:214,77566,905,23037,600,0002,032,0002,330,624
5Oct 11, 2024 03:214,79564,788,66337,808,0001,989,0002,510,848
6Oct 11, 2024 03:214,79664,580,78338,815,000995,0002,330,624