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 30, 2026 22:03Josu San MartinJosu San MartinScore: 4,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 22:034,24143,631,37534,167,0001,037,0002,113,536
2Aug 30, 2026 22:034,26143,836,52634,317,0001,050,0002,113,536
3Aug 30, 2026 22:034,26443,866,20834,275,0001,122,0002,113,536
4Aug 30, 2026 22:034,27944,027,65534,479,0001,039,0002,113,536
5Aug 30, 2026 22:034,28443,967,37934,437,0001,121,0002,113,536
6Aug 30, 2026 22:034,28444,070,65434,391,0001,173,0002,113,536
7Aug 30, 2026 22:034,31844,350,81834,729,0001,118,0002,113,536
8Aug 30, 2026 22:034,34344,511,31934,942,0001,111,0002,113,536
9Aug 30, 2026 22:034,36451,699,07435,179,0001,044,0002,113,536