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 listMay 3, 2026 05:31limanjun99limanjun99Score: 5,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 05:325,91166,835,95245,063,0004,005,0002,424,832
2May 3, 2026 05:325,91864,382,56445,116,0004,010,0002,437,120
3May 3, 2026 05:325,91867,607,72045,116,0004,010,0002,433,024
4May 3, 2026 05:325,92365,868,79145,149,0004,013,0002,428,928
5May 3, 2026 05:325,93072,524,38845,208,0004,018,0002,433,024
6May 3, 2026 05:325,93566,575,31045,242,0004,021,0002,428,928
7May 3, 2026 05:325,95163,890,49546,375,0003,024,0002,494,464
8May 3, 2026 05:325,95367,402,18046,390,0003,025,0002,428,928
9May 3, 2026 05:326,00973,506,36446,887,0002,992,0002,371,584