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 6, 2026 21:18TonyTonyScore: 20,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 21:1920,324178,516,561167,627,0001,065,0002,113,536
2Aug 6, 2026 21:1920,328178,664,947167,600,0001,123,0002,113,536
3Aug 6, 2026 21:1920,338178,566,860167,691,0001,121,0002,113,536
4Aug 6, 2026 21:1920,339178,705,881167,765,0001,050,0002,113,536
5Aug 6, 2026 21:1920,344178,718,807167,811,0001,052,0002,113,536
6Aug 6, 2026 21:1920,346178,631,214167,746,0001,132,0002,113,536
7Aug 6, 2026 21:1920,348178,797,385167,729,0001,165,0002,113,536
8Aug 6, 2026 21:1920,376179,018,667167,988,0001,138,0002,113,536
9Aug 6, 2026 21:1920,400179,148,460168,065,0001,255,0002,113,536