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 2, 2026 20:43TonyTonyScore: 9,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:449,12685,524,93873,203,0002,547,0002,113,536
2Aug 2, 2026 20:449,19786,207,61074,250,0002,089,0002,113,536
3Aug 2, 2026 20:449,21986,351,79173,827,0002,693,0002,113,536
4Aug 2, 2026 20:449,22386,363,42673,912,0002,646,0002,113,536
5Aug 2, 2026 20:449,22586,380,87674,546,0002,026,0002,113,536
6Aug 2, 2026 20:449,22686,493,43473,909,0002,669,0002,113,536
7Aug 2, 2026 20:449,25288,472,88274,122,0002,677,0002,113,536
8Aug 2, 2026 20:449,26386,700,43774,849,0002,034,0002,113,536
9Aug 2, 2026 20:449,27586,866,57874,319,0002,670,0002,113,536