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 20, 2026 05:38M-RochatM-RochatScore: 13,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:3813,242120,935,422107,808,0002,104,0002,113,536
2May 20, 2026 05:3813,273121,891,937108,065,0002,109,0002,113,536
3May 20, 2026 05:3813,275123,063,116108,075,0002,111,0002,113,536
4May 20, 2026 05:3813,290121,895,053108,228,0002,083,0002,113,536
5May 20, 2026 05:3813,310121,811,119108,239,0002,242,0002,113,536
6May 20, 2026 05:3813,330120,417,433108,537,0002,106,0002,113,536
7May 20, 2026 05:3813,391121,388,851108,907,0002,243,0002,113,536
8May 20, 2026 05:3813,419121,414,498109,167,0002,216,0002,113,536
9May 20, 2026 05:3813,420123,316,331109,134,0002,253,0002,113,536