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 listAug 2, 2026 21:48TonyTonyScore: 8,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 21:497,99676,317,41963,668,0002,704,0002,113,536
2Aug 2, 2026 21:498,00076,230,66263,802,0002,602,0002,113,536
3Aug 2, 2026 21:498,02376,538,52563,916,0002,677,0002,113,536
4Aug 2, 2026 21:498,02776,520,70363,946,0002,679,0002,113,536
5Aug 2, 2026 21:498,03976,531,95064,070,0002,661,0002,113,536
6Aug 2, 2026 21:498,04177,387,50664,036,0002,705,0002,113,536
7Aug 2, 2026 21:498,06276,758,18464,248,0002,673,0002,113,536
8Aug 2, 2026 21:498,06676,759,24864,266,0002,682,0002,113,536
9Aug 2, 2026 21:498,13777,348,57664,866,0002,676,0002,113,536