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 10, 2026 03:53Josu San MartinJosu San MartinScore: 4,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 03:534,46653,346,91436,030,0001,039,0002,555,904
2May 10, 2026 03:534,47153,533,27736,073,0001,042,0002,551,808
3May 10, 2026 03:534,47255,095,44036,077,0001,045,0002,547,712
4May 10, 2026 03:534,47853,948,38936,121,0001,050,0002,547,712
5May 10, 2026 03:534,49851,387,56836,156,0001,181,0002,555,904
6May 10, 2026 03:534,50352,437,52436,346,0001,032,0002,555,904
7May 10, 2026 03:534,50856,097,01636,388,0001,033,0002,551,808
8May 10, 2026 03:534,52553,340,11336,458,0001,107,0002,560,000
9May 10, 2026 03:534,57655,317,97936,947,0001,042,0002,555,904