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 07:12George SeabridgeGeorge SeabridgeScore: 9,722Success
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 07:128,61481,456,04270,417,0001,083,0002,113,536
2Aug 2, 2026 07:128,61681,446,13470,445,0001,076,0002,113,536
3Aug 2, 2026 07:128,62282,236,39870,463,0001,101,0002,113,536
4Aug 2, 2026 07:129,19886,298,28675,230,0001,115,0002,113,536
5Aug 2, 2026 07:129,72291,132,21079,597,0001,100,0002,113,536
6Aug 2, 2026 07:129,73290,685,92279,607,0001,172,0002,113,536
7Aug 2, 2026 07:129,73590,749,36179,699,0001,102,0002,113,536
8Aug 2, 2026 07:129,75591,720,19079,868,0001,104,0002,113,536
9Aug 2, 2026 07:129,75790,935,46479,768,0001,220,0002,113,536