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 listApr 21, 2026 02:01cashkarucashkaruScore: 61,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 02:0161,602540,574,251510,302,0001,000,0002,494,464
2Apr 21, 2026 02:0161,610536,406,855511,367,00002,506,752
3Apr 21, 2026 02:0161,624540,653,917507,491,0003,995,0002,494,464
4Apr 21, 2026 02:0161,625544,355,159510,495,000999,0002,502,656
5Apr 21, 2026 02:0161,627541,343,786510,509,000999,0002,494,464
6Apr 21, 2026 02:0161,636541,587,802507,590,0003,996,0002,277,376
7Apr 21, 2026 02:0161,637537,730,084509,593,0001,998,0002,494,464
8Apr 21, 2026 02:0161,639539,355,740510,607,000999,0002,506,752
9Apr 21, 2026 02:0161,641541,631,753509,628,0001,998,0002,494,464