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 14:01wnwnScore: 3,563Success
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 14:023,41042,830,88927,278,0001,029,0002,482,176
2May 9, 2026 14:023,42843,251,55627,429,0001,030,0002,478,080
3May 9, 2026 14:023,48643,438,46327,862,0001,076,0002,482,176
4May 9, 2026 14:023,53446,049,59428,252,0001,087,0002,494,464
5May 9, 2026 14:023,56345,101,33228,516,0001,064,0002,478,080
6May 9, 2026 14:023,56342,450,90728,502,0001,077,0002,473,984
7May 9, 2026 14:023,58446,325,45728,679,0001,074,0002,486,272
8May 9, 2026 14:023,61648,250,69528,920,0001,098,0002,486,272
9May 9, 2026 14:023,62445,464,84529,029,0001,057,0002,486,272