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 25, 2026 09:50Charles CabergsCharles CabergsScore: 18,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 09:5017,483160,689,547143,110,0002,001,0002,379,776
2Apr 25, 2026 09:5017,494162,421,758145,204,00002,363,392
3Apr 25, 2026 09:5017,513162,813,549144,360,0001,002,0002,363,392
4Apr 25, 2026 09:5018,037169,651,267147,716,0001,996,0002,379,776
5Apr 25, 2026 09:5018,116167,703,129149,367,0001,002,0002,371,584
6Apr 25, 2026 09:5018,116167,020,341149,366,0001,002,0002,367,488
7Apr 25, 2026 09:5018,136169,676,637149,531,0001,003,0002,367,488
8Apr 25, 2026 09:5018,140167,045,935149,560,0001,003,0002,371,584
9Apr 25, 2026 09:5018,143169,424,345149,589,0001,003,0002,367,488