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 26, 2026 16:06wnwnScore: 3,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:073,39943,452,52827,212,0001,007,0002,486,272
2Apr 26, 2026 16:073,40542,098,32527,254,0001,009,0002,486,272
3Apr 26, 2026 16:073,42047,518,71327,377,0001,013,0002,490,368
4Apr 26, 2026 16:073,45642,119,05327,669,0001,024,0002,482,176
5Apr 26, 2026 16:073,46641,570,05126,785,0001,984,0002,478,080
6Apr 26, 2026 16:073,47046,898,82226,823,0001,986,0002,486,272
7Apr 26, 2026 16:073,49247,133,93526,990,0001,999,0002,482,176
8Apr 26, 2026 16:073,56346,236,51528,555,0001,019,0002,482,176
9Apr 26, 2026 16:073,61846,272,55628,031,0002,002,0002,486,272