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 listAug 9, 2025 08:50Ashish AhujaAshish AhujaScore: 2,308,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2025 08:502,306,51919,193,740,89018,792,328,000351,781,0002,400,256
2Aug 9, 2025 08:502,308,01819,202,125,85018,810,753,000345,793,0002,433,024
3Aug 9, 2025 08:502,309,32619,210,946,79118,787,639,000379,770,0002,461,696