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 15, 2025 15:14AndreiAndreiScore: 63,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 15:1463,629553,127,826527,123,0001,000,0002,543,616
2Dec 15, 2025 15:1463,631566,197,725526,137,0002,000,0002,543,616
3Dec 15, 2025 15:1463,636553,404,222528,179,00002,531,328
4Dec 15, 2025 15:1463,642560,859,433527,227,0001,000,0002,383,872
5Dec 15, 2025 15:1463,675558,876,044526,508,0001,998,0002,555,904
6Dec 15, 2025 15:1463,685552,977,931524,593,0003,996,0002,535,424
7Dec 15, 2025 15:1463,701552,552,151527,718,000999,0002,543,616
8Dec 15, 2025 15:1463,709552,951,237526,783,0001,999,0002,523,136
9Dec 15, 2025 15:1463,733558,568,456526,986,0001,999,0002,539,520