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 11, 2026 00:31Josu San MartinJosu San MartinScore: 4,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 00:314,13143,062,86233,218,0001,077,0002,113,536
2May 11, 2026 00:314,13341,992,14533,172,0001,135,0002,113,536
3May 11, 2026 00:314,13343,798,61933,224,0001,080,0002,113,536
4May 11, 2026 00:314,13942,849,12633,281,0001,073,0002,113,536
5May 11, 2026 00:314,14543,362,18233,336,0001,069,0002,113,536
6May 11, 2026 00:314,15044,118,09233,376,0001,071,0002,113,536
7May 11, 2026 00:314,16741,919,89333,535,0001,055,0002,113,536
8May 11, 2026 00:314,18643,962,96333,662,0001,084,0002,113,536
9May 11, 2026 00:314,24344,707,30734,140,0001,079,0002,113,536