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 listApr 15, 2025 22:44k1k1Score: 66,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2025 22:4466,233575,067,118493,764,00055,973,0002,269,184
2Apr 15, 2025 22:4466,250572,529,242489,889,00059,986,0002,269,184
3Apr 15, 2025 22:4466,274577,924,352494,070,00056,008,0002,289,664
4Apr 15, 2025 22:4466,335578,750,559492,626,00057,956,0002,289,664
5Apr 15, 2025 22:4466,434580,887,656491,359,00060,043,0002,277,376
6Apr 15, 2025 22:4466,454580,206,172492,616,00058,954,0002,277,376
7Apr 15, 2025 22:4466,457582,692,805492,633,00058,956,0002,273,280
8Apr 15, 2025 22:4466,481573,879,706488,814,00062,976,0002,277,376
9Apr 15, 2025 22:4466,605576,574,648494,840,00057,981,0002,277,376