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 listJun 11, 2025 10:22cdillondcdillondScore: 160,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2025 10:22160,4611,357,913,5831,274,833,00056,992,0002,318,336
2Jun 11, 2025 10:22160,5521,358,088,3401,281,597,00050,983,0002,457,600
3Jun 11, 2025 10:22160,5661,353,274,0761,269,715,00062,985,0002,277,376
4Jun 11, 2025 10:22160,6001,363,961,7911,270,027,00062,951,0002,457,600
5Jun 11, 2025 10:22160,6281,358,255,6031,295,237,00037,977,0002,457,600
6Jun 11, 2025 10:22160,6371,355,985,5971,286,309,00046,974,0002,338,816
7Jun 11, 2025 10:22160,6881,356,952,7691,264,726,00068,985,0002,330,624
8Jun 11, 2025 10:22160,7901,365,791,2031,273,576,00060,979,0002,338,816
9Jun 11, 2025 10:22160,8671,361,804,9321,283,227,00051,968,0002,469,888