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 listAug 2, 2026 19:58TonyTonyScore: 9,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 19:599,37587,640,43275,322,0002,495,0002,113,536
2Aug 2, 2026 19:599,41587,973,51775,679,0002,472,0002,113,536
3Aug 2, 2026 19:599,42388,021,97375,583,0002,629,0002,117,632
4Aug 2, 2026 19:599,45088,284,93375,852,0002,590,0002,113,536
5Aug 2, 2026 19:599,45288,301,69975,992,0002,466,0002,113,536
6Aug 2, 2026 19:599,49188,623,08176,118,0002,658,0002,113,536
7Aug 2, 2026 19:599,49888,646,07876,326,0002,509,0002,113,536
8Aug 2, 2026 19:599,50888,860,12076,406,0002,514,0002,113,536
9Aug 2, 2026 19:599,52588,757,24176,438,0002,624,0002,113,536