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 listSep 17, 2025 20:55Adam FolwarcznyAdam FolwarcznyScore: 73,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 20:5573,441641,761,864542,611,00066,952,0002,457,600
2Sep 17, 2025 20:5573,493631,283,720543,993,00065,999,0002,498,560
3Sep 17, 2025 20:5573,611637,492,142543,975,00066,996,0002,387,968