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:47zielajzielajScore: 3,597Success
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:473,55353,048,38029,492,00002,527,232
2Nov 16, 2024 02:473,56257,255,09229,566,00002,347,008
3Nov 16, 2024 02:473,56350,037,51029,575,00002,347,008
4Nov 16, 2024 02:473,56553,546,99229,592,00002,527,232
5Nov 16, 2024 02:473,57358,238,28029,656,00002,355,200
6Nov 16, 2024 02:473,59757,355,48127,862,0001,990,0002,347,008
7Nov 16, 2024 02:473,59751,030,00828,858,000995,0002,527,232
8Nov 16, 2024 02:473,61757,429,99029,018,0001,000,0002,347,008
9Nov 16, 2024 02:473,63258,704,77928,135,0002,009,0002,527,232
10Nov 16, 2024 02:473,75452,809,45829,145,0002,010,0002,531,328
11Nov 16, 2024 02:473,78056,564,67531,370,00002,363,392
12Nov 16, 2024 02:473,79155,010,74331,468,00002,531,328