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 listMar 16, 2026 15:52Joel ChongJoel ChongScore: 63,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 15:5263,366548,645,042523,941,0001,999,0002,359,296
2Mar 16, 2026 15:5263,390550,546,965525,135,0001,000,0002,285,568
3Mar 16, 2026 15:5263,409558,125,182524,298,0001,997,0002,285,568
4Mar 16, 2026 15:5263,412558,568,091525,317,0001,000,0002,277,376
5Mar 16, 2026 15:5263,416551,507,643525,351,0001,000,0002,519,040
6Mar 16, 2026 15:5263,418552,898,344524,373,0001,997,0002,285,568
7Mar 16, 2026 15:5263,461549,805,335524,729,0001,998,0002,277,376
8Mar 16, 2026 15:5263,531561,946,236525,308,0001,997,0002,285,568
9Mar 16, 2026 15:5263,601554,517,776525,890,0001,999,0002,265,088