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 15, 2025 21:07Aryan JainAryan JainScore: 64,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2025 21:0764,603561,902,430485,187,00051,019,0002,387,968
2Aug 15, 2025 21:0764,669560,453,718479,778,00056,973,0002,285,568
3Aug 15, 2025 21:0764,669560,205,575471,783,00064,970,0002,383,872
4Aug 15, 2025 21:0764,735559,867,525481,269,00056,031,0002,289,664
5Aug 15, 2025 21:0764,801561,117,780475,869,00061,983,0002,289,664
6Aug 15, 2025 21:0764,842564,685,708478,165,00060,020,0002,387,968
7Aug 15, 2025 21:0764,842562,073,312478,165,00060,020,0002,285,568
8Aug 15, 2025 21:0764,935561,674,762483,963,00054,995,0002,482,176
9Aug 15, 2025 21:0764,980564,159,521482,302,00057,035,0002,392,064