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 listJan 16, 2022 20:39Yuriy LyfenkoYuriy LyfenkoScore: 31,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2022 20:1131,329330,635,359260,028,94402,207,744
2Jan 16, 2022 20:1431,330320,614,207260,035,61102,215,936
3Jan 16, 2022 20:3931,330322,248,062260,042,37202,220,032
4Jan 16, 2022 20:1131,332319,182,524260,056,98202,211,840
5Jan 16, 2022 20:1431,333327,078,826260,061,49202,220,032
6Jan 16, 2022 20:1131,334327,354,758260,072,53302,220,032
7Jan 16, 2022 20:3931,343316,202,085260,149,74602,211,840
8Jan 16, 2022 20:1431,345326,015,859260,159,71302,220,032
9Jan 16, 2022 20:3931,348328,510,844260,192,50002,228,224