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 9, 2025 19:13pseppsepScore: 65,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 19:1365,393566,600,584487,786,00054,975,0002,285,568
2Dec 9, 2025 19:1365,451564,253,366484,217,00059,026,0002,289,664
3Dec 9, 2025 19:1365,481569,858,232484,545,00058,944,0002,383,872
4Dec 9, 2025 19:1365,516566,424,083488,808,00054,978,0002,285,568
5Dec 9, 2025 19:1365,535571,901,319485,947,00057,993,0002,289,664
6Dec 9, 2025 19:1365,538566,390,768487,971,00055,996,0002,260,992
7Dec 9, 2025 19:1365,562566,756,925484,146,00060,018,0002,265,088
8Dec 9, 2025 19:1365,666568,447,789479,028,00066,003,0002,277,376
9Dec 9, 2025 19:1365,669577,706,189484,044,00061,005,0002,285,568