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 7, 2026 10:07wnwnScore: 3,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:083,41044,160,37627,264,0001,043,0002,486,272
2May 7, 2026 10:083,41543,734,59927,258,0001,091,0002,486,272
3May 7, 2026 10:083,42342,800,50727,345,0001,068,0002,490,368
4May 7, 2026 10:083,45343,920,85927,549,0001,114,0002,486,272
5May 7, 2026 10:083,53446,343,97028,266,0001,073,0002,478,080
6May 7, 2026 10:083,54852,804,31928,311,0001,143,0002,461,696
7May 7, 2026 10:083,61446,956,10528,908,0001,090,0002,486,272
8May 7, 2026 10:083,64445,359,86929,116,0001,131,0002,482,176
9May 7, 2026 10:083,65847,287,92429,244,0001,118,0002,482,176