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, 2026 17:46wnwnScore: 8,478Success
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, 2026 17:468,37193,754,46667,465,0002,013,0002,502,656
2Feb 16, 2026 17:468,47893,936,28268,358,0002,010,0002,392,064
3Feb 16, 2026 17:468,52497,301,95168,760,0001,993,0002,424,832