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 5, 2026 13:36wnwnScore: 3,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:373,48237,342,18327,871,0001,031,0002,113,536
2Sep 5, 2026 13:373,48337,375,05227,876,0001,034,0002,113,536
3Sep 5, 2026 13:373,48537,364,69527,898,0001,031,0002,113,536
4Sep 5, 2026 13:373,50037,477,12627,946,0001,108,0002,113,536
5Sep 5, 2026 13:373,50537,589,68128,075,0001,021,0002,113,536
6Sep 5, 2026 13:373,67738,920,79329,516,0001,007,0002,113,536
7Sep 5, 2026 13:373,69039,064,96029,595,0001,038,0002,113,536
8Sep 5, 2026 13:373,69639,804,31529,640,0001,044,0002,113,536
9Sep 5, 2026 13:373,69639,173,80729,651,0001,026,0002,113,536