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 7, 2026 15:32TonyTonyScore: 6,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 15:326,21261,352,40949,025,0002,535,0002,113,536
2Aug 7, 2026 15:326,23261,539,56049,151,0002,575,0002,113,536
3Aug 7, 2026 15:326,24361,689,56249,262,0002,558,0002,113,536
4Aug 7, 2026 15:326,25661,768,12849,392,0002,541,0002,113,536
5Aug 7, 2026 15:326,27461,951,99649,519,0002,559,0002,113,536
6Aug 7, 2026 15:326,27961,959,22449,551,0002,571,0002,113,536
7Aug 7, 2026 15:326,28862,023,62650,165,0002,033,0002,113,536
8Aug 7, 2026 15:326,28862,133,00149,668,0002,524,0002,113,536
9Aug 7, 2026 15:326,30662,129,72849,733,0002,608,0002,113,536