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 1, 2026 14:54George SeabridgeGeorge SeabridgeScore: 8,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 14:558,88583,728,01972,670,0001,082,0002,113,536
2Aug 1, 2026 14:558,89383,805,99172,722,0001,090,0002,113,536
3Aug 1, 2026 14:558,90184,165,76972,792,0001,087,0002,113,536
4Aug 1, 2026 14:558,94184,211,42373,122,0001,095,0002,113,536
5Aug 1, 2026 14:558,96784,511,63273,343,0001,085,0002,113,536
6Aug 1, 2026 14:5510,25595,092,59084,032,0001,085,0002,113,536
7Aug 1, 2026 14:5510,29795,469,35784,446,0001,024,0002,113,536
8Aug 1, 2026 14:5510,42097,259,71385,468,0001,020,0002,113,536
9Aug 1, 2026 14:5511,047101,741,70190,592,0001,105,0002,113,536