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 listAug 1, 2026 12:01George SeabridgeGeorge SeabridgeScore: 10,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 12:0110,66698,546,83787,450,0001,081,0002,113,536
2Aug 1, 2026 12:0110,68099,417,19187,571,0001,080,0002,113,536
3Aug 1, 2026 12:0110,68698,691,33987,620,0001,078,0002,113,536
4Aug 1, 2026 12:0110,69398,790,68787,675,0001,077,0002,113,536
5Aug 1, 2026 12:0110,70999,678,20687,807,0001,080,0002,113,536
6Aug 1, 2026 12:0111,958110,085,09898,044,0001,215,0002,113,536
7Aug 1, 2026 12:0111,993110,349,92398,447,0001,099,0002,113,536
8Aug 1, 2026 12:0112,008110,024,48998,562,0001,105,0002,113,536
9Aug 1, 2026 12:0112,023109,808,85098,662,0001,133,0002,113,536