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 22, 2026 09:07wnwnScore: 4,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 09:084,67057,061,59836,778,0001,988,0002,490,368
2Apr 22, 2026 09:084,72460,028,21438,208,0001,005,0002,478,080
3Apr 22, 2026 09:084,72559,994,40938,218,0001,005,0002,478,080
4Apr 22, 2026 09:084,74159,878,33939,352,00002,486,272
5Apr 22, 2026 09:084,76754,970,79538,560,0001,014,0002,486,272
6Apr 22, 2026 09:084,82053,382,57438,012,0002,000,0002,486,272
7Apr 22, 2026 09:084,85954,046,02939,326,0001,008,0002,490,368
8Apr 22, 2026 09:084,90657,526,03538,738,0001,986,0002,482,176
9Apr 22, 2026 09:084,94060,860,58639,009,0002,000,0002,478,080