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 listNov 23, 2024 14:35E SequeiraE SequeiraScore: 13,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 14:3513,372138,922,818109,987,000999,0002,306,048
2Nov 23, 2024 14:3513,378144,477,098109,037,0002,000,0002,289,664
3Nov 23, 2024 14:3513,383138,756,169110,082,0001,000,0002,281,472
4Nov 23, 2024 14:3513,384140,804,789109,085,0002,001,0002,281,472
5Nov 23, 2024 14:3513,387143,407,522109,108,0002,001,0002,473,984
6Nov 23, 2024 14:3513,388136,370,845110,120,0001,001,0002,465,792
7Nov 23, 2024 14:3513,394138,417,829109,164,0002,003,0002,289,664
8Nov 23, 2024 14:3513,395134,525,521109,175,0002,003,0002,289,664
9Nov 23, 2024 14:3513,397134,343,071109,191,0002,003,0002,281,472