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 listMar 22, 2026 09:15Dominique GarmierDominique GarmierScore: 332,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 20:02332,0452,784,799,1182,754,977,000999,0002,273,280
2Mar 22, 2026 09:15332,2182,781,667,5552,756,410,000999,0002,531,328
3Mar 22, 2026 20:02332,2982,784,849,8152,757,077,000999,0002,277,376
4Mar 22, 2026 09:15332,8172,787,421,4402,760,381,0001,998,0002,277,376
5Mar 22, 2026 09:15332,8662,789,076,1632,760,786,0001,999,0002,469,888
6Mar 22, 2026 20:02333,6802,794,255,0642,766,547,0002,998,0002,478,080