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:06George SeabridgeGeorge SeabridgeScore: 8,915Success
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:068,25878,456,79365,393,0003,156,0002,113,536
2Aug 2, 2026 20:068,27078,627,58565,476,0003,165,0002,113,536
3Aug 2, 2026 20:068,28978,692,43465,758,0003,045,0002,113,536
4Aug 2, 2026 20:068,36480,801,89066,238,0003,187,0002,113,536
5Aug 2, 2026 20:068,91583,990,03570,834,0003,163,0002,113,536
6Aug 2, 2026 20:069,00584,663,60971,631,0003,118,0002,113,536
7Aug 2, 2026 20:069,00984,719,27771,594,0003,188,0002,113,536
8Aug 2, 2026 20:069,04584,998,64771,894,0003,183,0002,113,536
9Aug 2, 2026 20:069,07185,174,54872,252,0003,041,0002,113,536