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 1, 2023 14:35Vytautas GruslysVytautas GruslysScore: 29,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2023 14:3528,768267,561,417238,777,00002,281,472
2Jan 1, 2023 14:3528,928264,068,778239,099,0001,000,0002,281,472
3Jan 1, 2023 14:3528,979311,805,761240,522,91502,289,664
4Jan 1, 2023 14:3528,989322,598,717240,610,86902,285,568
5Jan 1, 2023 14:3528,991298,704,003240,626,50302,285,568
6Jan 1, 2023 14:3529,010271,016,590239,780,000999,0002,281,472
7Jan 1, 2023 14:3529,051262,775,370239,120,0002,001,0002,531,328
8Jan 1, 2023 14:3529,130270,365,357240,781,000999,0002,265,088
9Jan 1, 2023 14:3529,149262,633,058239,937,0001,999,0002,379,776
10Jan 1, 2023 14:3529,316264,521,479241,321,0002,002,0002,535,424
11Jan 1, 2023 14:3529,353268,620,975242,636,000998,0002,281,472
12Jan 1, 2023 14:3529,528273,023,397244,081,0001,000,0002,281,472