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 31, 2025 13:21Emanuele BolognesiEmanuele BolognesiScore: 66,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2025 13:2166,570582,515,184550,534,0001,998,0002,273,280
2May 31, 2025 13:2166,588578,447,543550,685,0001,998,0002,265,088
3May 31, 2025 13:2166,595584,518,756551,743,000999,0002,285,568