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 listOct 26, 2026 15:01Magdalena BartczakMagdalena BartczakScore: 523,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2026 15:02523,0934,352,497,5974,279,627,00062,046,0002,113,536
2Oct 26, 2026 15:02523,3904,354,920,7464,282,095,00062,042,0002,113,536
3Oct 26, 2026 15:02523,7784,358,376,1594,284,171,00063,187,0002,113,536
4Oct 26, 2026 15:02523,8804,359,059,3724,285,163,00063,046,0002,113,536
5Oct 26, 2026 15:02523,9734,359,840,9644,286,929,00062,052,0002,113,536
6Oct 26, 2026 15:02524,0054,359,997,8884,287,204,00062,042,0002,113,536
7Oct 26, 2026 15:02524,1844,361,453,5014,288,688,00062,044,0002,113,536
8Oct 26, 2026 15:02527,0884,385,966,9054,311,790,00063,047,0002,113,536
9Oct 26, 2026 15:02529,0164,401,654,9664,327,656,00063,185,0002,113,536