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 9, 2026 12:20wnwnScore: 3,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 12:213,38244,276,04727,023,0001,049,0002,490,368
2May 9, 2026 12:213,38243,634,78327,027,0001,050,0002,494,464
3May 9, 2026 12:213,38345,313,93827,022,0001,063,0002,486,272
4May 9, 2026 12:213,38546,159,90327,033,0001,066,0002,490,368
5May 9, 2026 12:213,38643,724,45727,040,0001,065,0002,486,272
6May 9, 2026 12:213,39442,576,88527,083,0001,089,0002,490,368
7May 9, 2026 12:213,39544,428,01527,136,0001,049,0002,494,464
8May 9, 2026 12:213,39941,816,99827,157,0001,055,0002,490,368
9May 9, 2026 12:213,53645,406,34228,277,0001,075,0002,482,176