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 listFeb 16, 2024 00:17Varun MathurVarun MathurScore: 1,597,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 00:171,596,41213,304,248,50313,250,221,71202,260,992
2Feb 16, 2024 00:171,597,82813,326,592,45613,261,970,19502,265,088
3Feb 16, 2024 00:171,768,03614,753,182,02414,674,700,65202,248,704