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 00:44Josu San MartinJosu San MartinScore: 5,266Success
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 00:455,24257,779,31342,476,0001,039,0002,539,520
2May 10, 2026 00:455,24460,123,59042,488,0001,043,0002,539,520
3May 10, 2026 00:455,24761,915,50742,512,0001,041,0002,555,904
4May 10, 2026 00:455,25659,946,24042,553,0001,080,0002,547,712
5May 10, 2026 00:455,26662,866,21342,643,0001,065,0002,543,616
6May 10, 2026 00:455,29057,458,82142,875,0001,033,0002,547,712
7May 10, 2026 00:455,33258,933,15043,172,0001,087,0002,551,808
8May 10, 2026 00:455,41861,053,94343,894,0001,080,0002,543,616
9May 10, 2026 00:455,42859,274,79044,011,0001,045,0002,551,808