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 16, 2024 02:08zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 16, 2024 02:0700000Error: Killed by timeoutstderr
2Nov 16, 2024 02:083,52748,629,00828,262,0001,009,0002,347,008
3Nov 16, 2024 02:083,53656,907,55229,348,00002,351,104
4Nov 16, 2024 02:083,54658,109,52929,429,00002,347,008
5Nov 16, 2024 02:083,55552,523,18628,491,0001,017,0002,351,104
6Nov 16, 2024 02:083,56358,914,26929,574,00002,527,232
7Nov 16, 2024 02:083,56660,959,92229,594,00002,527,232
8Nov 16, 2024 02:083,56652,490,72828,574,0001,020,0002,351,104
9Nov 16, 2024 02:083,56955,675,09228,603,0001,021,0002,424,832
10Nov 16, 2024 02:083,57458,626,17028,641,0001,022,0002,351,104
11Nov 16, 2024 02:083,75452,323,10729,147,0002,010,0002,359,296
12Nov 16, 2024 02:083,76855,882,11029,255,0002,017,0002,355,200
13Nov 16, 2024 02:083,80858,234,42431,607,00002,277,376