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 listDec 21, 2025 00:32jhallgreenjhallgreenScore: 371,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 00:32368,4143,080,919,2822,972,872,00084,967,0002,351,104
2Dec 21, 2025 00:32370,3033,100,325,8943,011,546,00061,970,0002,281,472
3Dec 21, 2025 00:32371,2693,106,934,1313,014,564,00066,968,0002,289,664
4Dec 21, 2025 00:32371,6943,114,828,8283,015,103,00069,956,0002,281,472
5Dec 21, 2025 00:32371,9923,119,865,0623,012,567,00074,964,0002,281,472
6Dec 21, 2025 00:32372,0183,117,768,3083,023,778,00063,974,0002,289,664
7Dec 21, 2025 00:32372,3853,113,687,5083,031,818,00058,977,0002,281,472
8Dec 21, 2025 00:32375,1293,143,828,2413,067,595,00045,978,0002,281,472
9Dec 21, 2025 00:32378,4423,174,235,9333,081,088,00059,982,0002,289,664