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 1, 2026 21:02TonyTonyScore: 52,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 21:0252,895447,351,132438,031,0001,002,0002,117,632
2Aug 1, 2026 21:0252,896447,582,012438,040,0001,003,0002,117,632
3Aug 1, 2026 21:0252,897447,658,997438,048,0001,003,0002,117,632
4Aug 1, 2026 21:0252,898447,371,991438,058,0001,003,0002,117,632
5Aug 1, 2026 21:0252,900447,339,294438,069,0001,002,0002,117,632
6Aug 1, 2026 21:0252,901447,394,943438,083,0001,002,0002,117,632
7Aug 1, 2026 21:0252,909447,760,517438,143,0001,002,0002,117,632
8Aug 1, 2026 21:0252,922447,677,877438,256,0001,002,0002,117,632
9Aug 1, 2026 21:0252,936449,206,771438,374,0001,003,0002,117,632