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 15:49George SeabridgeGeorge SeabridgeScore: 10,432Success
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 15:4910,41596,407,80185,247,0001,205,0002,113,536
2Aug 2, 2026 15:4910,41897,157,89485,255,0001,217,0002,113,536
3Aug 2, 2026 15:4910,41896,447,70785,268,0001,209,0002,113,536
4Aug 2, 2026 15:4910,42297,715,44485,299,0001,211,0002,113,536
5Aug 2, 2026 15:4910,43296,572,49685,375,0001,214,0002,113,536
6Aug 2, 2026 15:4910,47096,826,19985,680,0001,223,0002,113,536
7Aug 2, 2026 15:4910,48096,932,20985,757,0001,231,0002,113,536
8Aug 2, 2026 15:4910,52297,238,62186,121,0001,212,0002,113,536
9Aug 2, 2026 15:4910,973101,003,57389,859,0001,218,0002,113,536