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 listApr 27, 2026 05:57wnwnScore: 3,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:583,55049,213,29828,452,0001,016,0002,330,624
2Apr 27, 2026 05:583,64547,232,82929,247,0001,008,0002,486,272
3Apr 27, 2026 05:583,66049,332,17129,373,0001,012,0002,486,272
4Apr 27, 2026 05:583,69547,600,93429,647,0001,022,0002,326,528
5Apr 27, 2026 05:583,72347,429,32728,909,0001,993,0002,482,176
6Apr 27, 2026 05:583,72544,016,22928,925,0001,994,0002,482,176
7Apr 27, 2026 05:583,72944,399,36728,960,0001,997,0002,486,272
8Apr 27, 2026 05:583,73950,191,72330,036,0001,001,0002,482,176
9Apr 27, 2026 05:583,79845,639,53230,514,0001,017,0002,486,272