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 14:57George SeabridgeGeorge SeabridgeScore: 10,860Success
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 14:5710,83099,959,04788,684,0001,208,0002,113,536
2Aug 2, 2026 14:5710,843100,371,57188,801,0001,204,0002,113,536
3Aug 2, 2026 14:5710,84999,964,21888,829,0001,220,0002,113,536
4Aug 2, 2026 14:5710,850100,000,93488,845,0001,214,0002,113,536
5Aug 2, 2026 14:5710,860100,844,27988,938,0001,208,0002,113,536
6Aug 2, 2026 14:5710,869100,143,57288,999,0001,221,0002,113,536
7Aug 2, 2026 14:5710,929100,640,37589,488,0001,223,0002,113,536
8Aug 2, 2026 14:5711,094102,054,16090,854,0001,230,0002,113,536
9Aug 2, 2026 14:5711,109102,185,27590,948,0001,264,0002,113,536