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 listJan 11, 2025 16:35Advait IyerAdvait IyerScore: 153,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 16:35153,3071,297,728,5591,270,450,0001,999,0002,531,328
2Jan 11, 2025 16:35153,3301,299,407,8391,267,644,0004,998,0002,265,088
3Jan 11, 2025 16:35153,3751,298,857,6931,271,010,0002,000,0002,523,136
4Jan 11, 2025 16:35153,3791,304,254,3621,271,044,0001,998,0002,277,376
5Jan 11, 2025 16:35153,3921,299,519,2031,270,156,0002,998,0002,277,376
6Jan 11, 2025 16:35153,3941,302,148,3601,270,174,0002,998,0002,281,472
7Jan 11, 2025 16:35153,4201,303,236,3771,271,389,0001,999,0002,265,088
8Jan 11, 2025 16:35153,4951,304,440,8291,272,013,0001,998,0002,277,376
9Jan 11, 2025 16:35153,5421,309,185,3721,272,403,0001,999,0002,277,376