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 28, 2026 19:24wnwnScore: 4,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 19:244,72661,109,81137,216,0002,011,0002,486,272
2Feb 28, 2026 19:244,75564,617,11238,456,0001,012,0002,277,376
3Feb 28, 2026 19:244,80966,367,14537,922,0001,995,0002,277,376