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 listMar 7, 2026 12:41Mohammad Anas KhanMohammad Anas KhanScore: 150,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2026 12:41150,5871,275,976,0261,248,875,000999,0002,531,328
2Mar 7, 2026 12:41150,6221,278,459,4041,249,167,000999,0002,285,568
3Mar 7, 2026 12:41150,6241,276,262,2211,249,184,000999,0002,260,992
4Mar 7, 2026 12:41150,6311,277,645,4991,248,239,0001,998,0002,285,568
5Mar 7, 2026 12:41150,6321,279,813,3961,249,244,000999,0002,527,232
6Mar 7, 2026 12:41150,6331,278,754,2871,248,259,0001,998,0002,285,568
7Mar 7, 2026 12:41150,6531,277,360,6601,249,423,000999,0002,285,568
8Mar 7, 2026 12:41150,6531,282,777,8791,248,425,0001,999,0002,519,040
9Mar 7, 2026 12:41150,7241,279,229,5501,250,012,0001,000,0002,285,568