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 08:27George SeabridgeGeorge SeabridgeScore: 7,834Success
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 08:287,79775,408,15263,627,0001,095,0002,113,536
2Aug 2, 2026 08:287,81275,606,79563,703,0001,144,0002,113,536
3Aug 2, 2026 08:287,82876,165,27363,868,0001,108,0002,113,536
4Aug 2, 2026 08:287,83075,700,92763,880,0001,110,0002,113,536
5Aug 2, 2026 08:287,83474,952,17963,932,0001,091,0002,113,536
6Aug 2, 2026 08:287,83974,979,10263,792,0001,279,0002,113,536
7Aug 2, 2026 08:287,83975,644,52863,978,0001,089,0002,113,536
8Aug 2, 2026 08:287,84675,029,42664,044,0001,085,0002,113,536
9Aug 2, 2026 08:287,85075,859,18664,050,0001,107,0002,113,536