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 7, 2026 18:03Benn TanBenn TanScore: 19,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 18:0319,845191,329,450162,720,0001,996,0002,277,376
2Feb 7, 2026 18:0319,845196,597,245162,719,0001,996,0002,392,064
3Feb 7, 2026 18:0319,849201,565,959163,747,000998,0002,396,160