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 26, 2026 15:31wnwnScore: 3,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:313,39548,631,05428,179,00002,486,272
2Apr 26, 2026 15:313,42348,113,94427,399,0001,014,0002,482,176
3Apr 26, 2026 15:313,43347,037,31827,480,0001,017,0002,478,080
4Apr 26, 2026 15:313,44045,839,33027,540,0001,020,0002,482,176
5Apr 26, 2026 15:313,44745,143,70327,594,0001,022,0002,473,984
6Apr 26, 2026 15:313,44842,039,28427,600,0001,022,0002,494,464
7Apr 26, 2026 15:313,47941,873,84327,883,000995,0002,486,272
8Apr 26, 2026 15:313,53446,822,56428,325,0001,011,0002,486,272
9Apr 26, 2026 15:313,60444,522,91927,921,0001,994,0002,490,368