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 20:06Josu San MartinJosu San MartinScore: 6,314Success
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 20:076,30360,753,30451,218,0001,099,0002,113,536
2Aug 30, 2026 20:076,30560,828,80451,315,0001,022,0002,113,536
3Aug 30, 2026 20:076,30660,805,28151,305,0001,037,0002,113,536
4Aug 30, 2026 20:076,31061,555,83551,262,0001,113,0002,113,536
5Aug 30, 2026 20:076,31460,819,57251,270,0001,141,0002,113,536
6Aug 30, 2026 20:076,31460,801,80451,306,0001,103,0002,113,536
7Aug 30, 2026 20:076,31660,880,91551,309,0001,121,0002,113,536
8Aug 30, 2026 20:076,31960,827,67351,328,0001,122,0002,113,536
9Aug 30, 2026 20:076,31960,942,59051,314,0001,140,0002,113,536