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 3, 2026 03:40CheckHarryCheckHarryScore: 6,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 03:406,02259,786,53948,825,0001,165,0002,113,536
2Sep 3, 2026 03:406,02659,890,19048,852,0001,169,0002,113,536
3Sep 3, 2026 03:406,03159,957,34649,023,0001,042,0002,113,536
4Sep 3, 2026 03:406,03259,888,02049,020,0001,048,0002,113,536
5Sep 3, 2026 03:406,03359,986,96749,022,0001,057,0002,113,536
6Sep 3, 2026 03:406,03459,930,37049,022,0001,067,0002,117,632
7Sep 3, 2026 03:406,03459,911,49549,048,0001,037,0002,113,536
8Sep 3, 2026 03:406,04059,966,66949,095,0001,043,0002,113,536
9Sep 3, 2026 03:406,04260,086,05749,095,0001,056,0002,113,536