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 9, 2025 03:30Leon ZhaoLeon ZhaoScore: 14,036Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2025 03:3014,023139,209,481115,385,0001,003,0002,465,792
2Aug 9, 2025 03:3014,027139,869,445115,423,0001,003,0002,469,888
3Aug 9, 2025 03:3014,030141,600,971115,442,0001,003,0002,469,888
4Aug 9, 2025 03:3014,031138,480,574115,454,0001,003,0002,310,144
5Aug 9, 2025 03:3014,036145,135,102115,491,0001,004,0002,285,568
6Aug 9, 2025 03:3014,039144,886,266115,516,0001,004,0002,285,568
7Aug 9, 2025 03:3014,061142,025,170114,713,0001,995,0002,285,568
8Aug 9, 2025 03:3014,064142,311,075114,735,0001,995,0002,285,568
9Aug 9, 2025 03:3014,067140,123,939116,756,00002,473,984