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 5, 2024 14:32Matt StuchlikMatt StuchlikScore: 34,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 5, 2024 14:2334,687357,668,168287,898,72302,293,760
2Apr 5, 2024 14:3234,687349,111,730287,905,00902,281,472
3Apr 5, 2024 14:2334,688342,446,638287,909,77002,285,568
4Apr 5, 2024 14:2334,700347,078,605288,010,63502,285,568
5Apr 5, 2024 14:3234,726348,618,703288,228,92202,277,376
6Apr 5, 2024 14:3235,636353,167,592295,780,02402,281,472